#include <bits/stdc++.h>
#define f(i,a,b) for(int i = (a); i <= (b); i++)
#define fd(i,a,b) for(int i = (a); i >= (b); i--)

using namespace std;

const int RIGHT = 32768;
const int SIZE = 66000;
int L[30005], H[30005], N, T[SIZE], Tests;

void update(int x, int v, int n = 1, int a = 1, int b = RIGHT)
{
    if(a == b)
    {
        T[n] = max(T[n], v);
        return;
    }

    int mid = (a+b) / 2;
    if(x <= mid) update(x,v,2*n,a,mid);
    else update(x,v,2*n+1,mid+1,b);

    T[n] = max(T[2*n], T[2*n+1]);
}

int query(int l, int r, int n = 1, int a = 1, int b = RIGHT)
{
    if(a > r || b < l) return T[0];
    if(a >= l && b <= r) return T[n];
    int mid = (a+b) / 2;
    return max(query(l,r,2*n,a,mid), query(l,r,2*n+1,mid+1,b));
}

int main()
{
    cin >> Tests;

    f(tt,1,Tests)
    {
        cin >> N;
        f(i,1,N) scanf("%d", &H[i]);
        f(i,0,SIZE-1) T[i] = 0;
        f(i,1,N)
        {
            L[i] = query(1,H[i]-1) + 1;
            update(H[i], i);
        }
        f(i,0,SIZE-1) T[i] = -(N+1);
        int ans = 0;
        fd(i,N,1)
        {
            int r = -query(1,H[i]-1) - 1;
            ans = max(ans, H[i] * (r-L[i]+1));
            update(H[i], -i);
        }
        cout << "Case " << tt << ": " << ans << "\n";
    }
}