UVA11059

//11059

#include"iostream"
#include"algorithm"
#include"vector"
#include"map"
#include"string"
#include"cctype"
#include"deque"
#include"queue"
#include"stack"
#include"cstdio"
#include"cmath"
#include"set"
#include"sstream"
using namespace std;
int main()
{
	//freopen("a.txt","r",stdin);
	int n;
	int ks=0;
	int a[20];
	while(cin>>n)
	{
		int i,j,k;
		for(i=0;i<n;i++)
			cin>>a[i];
		long long int sum;
		long long int maxn=0;
		for(i=0;i<n;i++)
		{
			for(j=i;j<n;j++)
			{
				sum=1;
				for(k=i;k<=j;k++)
					sum=sum*a[k];
				if(sum>maxn) maxn=sum;
			}
		}
		printf("Case #%d: The maximum product is %lld.\n\n",++ks,maxn);
	}
	return 0;
}

/*a.txt*/
/*
3
2 4 -3
5
2 5 -1 2 -1
*/