#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 100010;
long long a[N],b[N];
int main()
{
	int n,m,i,l,t=1;
	long long tt,k=0,x=1;
	while(cin>>n)
	{
		memset(a,0,sizeof(a));
		memset(b,0,sizeof(b));
		k=0;
		a[0]=1;
		b[0]=1;
		x=1;		
		for(i=1;i<=n;i++)
		{
			cin>>a[i];
			b[i]=x*a[i];
			if(b[i]==0) x=1;
			else x=b[i];
		}
		for(i=1;i<=n;i++)
		{
			tt=0;
			for(l=i;l<=n;l++)
			{
				if(b[l]==0) break;
				if(b[i]==0) tt=0;
				else if(b[i-1]!=0) tt=b[l]/b[i-1];
				else tt=b[l];
				k=max(k,tt);
			}
		}
		if(k>0) printf("Case #%d: The maximum product is %lld.\n\n",t,k);
		else printf("0\n\n");
		t++;
	}
	return 0;
}