int main()

{
    long long int num,data,max=1,round=0;
    vector<int> v;
    vector<long long int> Max;
    while(cin>>num)

    {      
          round++; 
          for(int i=0;i<num;i++)
          {
                  cin>>data;
                  v.push_back(data);
          }

          for(unsigned int i=0;i<v.size();i++)
          {
          for(unsigned int j=0;j<v.size()-i;j++)
          {
          for(unsigned int k=i;k<v.size()-j;k++)

          {
                  max=max*v[k];                //brute force
          }

          Max.push_back(max);
          max=1;

          }

          }

          sort(Max.begin(),Max.end());  //由小排到大

          if(Max[Max.size()-1]<0 )  //最後一個如果是負數就變0

          {
              Max[Max.size()-1]=0;

          }
          //印出最大的那個數字 
          cout<<"Case #"<<round<<": The maximum product is "<<Max[Max.size()-1]<<'.'<<endl<<endl;
          v.clear();
          Max.clear();
    }         
    return 0;
}