acm mock contest 2016-D

#include<bits/stdc++.h>
#include<vector>

using namespace std;

int main()
{
    int n,t,maximum;
    long long length;
    cin >> n;
    for(int i=1; i<=n; i++)
    {
        cin >>t;
        maximum = 0;
        map < long long, int>box;
        for(int j=0; j<t; j++)
        {
            cin >> length;
            box[length]++;
            maximum = max(maximum, box[length]);
        }
        cout <<"Case "<<i<<": "<<maximum<<endl;
    }

    return 0;
}