#include <iostream>
#define ll long long
using namespace std;
int main() {
int n, ncase = 0;
while (cin >> n) {
ll ans = 0;
ll num[18];
for (int i = 0; i < n; i++) cin >> num[i];
for (int i = 0; i < n; i++) { // 从头到尾遍历
for (int j = 0; i + j < n; j++) { // 子串长度
ll tmp = 1;
for (int k = 0; k <= j; k++)
tmp *= num[i+k];
if (tmp > ans)
ans = tmp;
}
}
if (ans < 0) ans = 0;
printf("Case #%d: The maximum product is %lld.\n\n", ++ncase, ans);
}
}