/*
Link: http://www.lightoj.com/volume_showproblem.php?problem=1249
*/

#include <bits/stdc++.h>

#define pii pair <int,int>
#define sc scanf
#define pf printf
#define Pi 2*acos(0.0)
#define ms(a,b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define MP make_pair
#define oo 1<<29
#define dd double
#define ll long long
#define EPS 10E-10
#define ff first
#define ss second
#define MAX 10000
#define SZ(a) (int)a.size()
#define getint(a) scanf("%d",&a)
#define loop(i,n) for(int i=0;i<n;i++)
#define TEST_CASE(t) for(int z=1;z<=t;z++)
#define PRINT_CASE printf("Case %d: ",z)
#define all(a) a.begin(),a.end()
#define intlim 2147483648
#define inf 1000000
#define rtintlim 46340
#define llim 9223372036854775808
#define rtllim 3037000499
#define ull unsigned long long
#define I int

using namespace std;

/* Bits operation */
int Set(int n,int pos)  { return n = n | 1<<pos;}
bool check(int n,int pos) { return n & 1<<pos;}
int Reset(int n, int pos) { return n=n & ~(1<<pos);}

struct data
{
    string name;
    int cube=0;
};

bool test(data a, data b)
{
    return a.cube < b.cube;
}
int main()
{
    ///freopen("in.txt","r",stdin);
    ///freopen("out.txt","w",stdout);
    vector<data>v;
    int t,n;
    getint(t);
    TEST_CASE(t)
    {
        data temp;
        int a,b,c;
        getint(n);
        loop(i,n)
        {
            cin>>temp.name;
            getint(a);
            getint(b);
            getint(c);
            temp.cube=a*b*c;
            v.pb(temp);
        }
        sort(all(v),test);
        PRINT_CASE;
        if(v[0].cube==v[n-1].cube)
            pf("no thief\n");
        else
        {
            cout<<v[n-1].name<<" ";
            pf("took chocolate from ");
            cout<<v[0].name<<endl;
        }
        v.clear();
    }
    return 0;
}