//
//  main.cpp
//  largeNumberSort
//
//  Created by richard on 9/9/15.
//  Copyright (c) 2015 luxin. All rights reserved.
//
#include <iostream>
#include <map>
#include <string>

using namespace std;



int main(){
    
    //    freopen("/Users/RichardLu/Code/C++/Algorithm/largeNumberSort/largeNumberSort/largeNumberSort/testcase.in", "r", stdin);
    //    freopen("/Users/RichardLu/Code/C++/Algorithm/largeNumberSort/largeNumberSort/largeNumberSort/testcase.out", "w", stdout);
    
    
    map<string, int> string_int_map;
    string a;
    int count = 0;
    while (cin >> count&&count) {
        string_int_map.clear();
        while (count--) {
            cin >> a;
            string_int_map[a]++;
        }
        
        string most = "";
        for (map<string, int>::iterator it = string_int_map.begin(); it != string_int_map.end(); ++it) {
            if (it->second > string_int_map[most]) {
                most = it->first;
            }
        }
        cout <<most<<endl;
    }
    
    //    fclose(stdin);
    //    fclose(stdout);
    
    return 0;
}

#include <stdio.h>
#define  MAX_LEN  100000UL

int max_subsq(int *array, unsigned int size, unsigned int *start, unsigned int *end)
{
    int max_sum = -2000, sum = 0;
    int curstart = *start = 0;
    unsigned int i;
    
    for (i = 0; i < size; i++){
        if (sum < 0){
            sum = array[i];//丢弃之前的子串
            curstart = i;  //将当前位置作为新的起始位置
        } else {
            sum += array[i];
        }
        
        if (sum > max_sum){
            max_sum = sum;
            *start = curstart;
            *end   = i;
        }
    }
    
    return max_sum;
}

int main(void)
{
    int A[MAX_LEN];
    int i = 0, round, n, max;
    unsigned int start, end;
    freopen("/Users/RichardLu/Code/C++/Algorithm/largeNumberSort/largeNumberSort/largeNumberSort/testcase.in", "r", stdin);
    freopen("/Users/RichardLu/Code/C++/Algorithm/largeNumberSort/largeNumberSort/largeNumberSort/testcase.out", "w", stdout);
    scanf("%d", &round);
    
    while (i++ < round)
    {
        scanf("%d", &n);
        for (int j = 0; j < n; j++){
            scanf("%d", &A[j]);
        }
        max = max_subsq(A, n, &start, &end);
        
        printf("Case %d:\n", i);
        printf("%d %d %d\n", max, start + 1, end + 1);
        
        if (i != round) printf("\n");
    }
    fclose(stdin);
    fclose(stdout);
    return 0;
}