uva11059

#include<iostream>
using namespace std;
int main() {
  int S[20], kase = 0, n;
  while(cin >> n && n) {
    for(int i = 0; i < n; i++) cin >> S[i];
    long long ans = 0;
    for(int i = 0; i < n; i++) {	//i是起点 
      long long v = 1;
      for(int j = i; j < n; j++) {	//j是终点 
        v *= S[j];			//计算每个连续序列的乘积 
        if(v > ans) ans = v;	//更新ans为更大值 
      }
    }
    cout << "Case #" << ++kase << ": The maximum product is " << ans << ".\n\n";
  }
  return 0;
}