#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
   int t,i=0,n,a,b,c,d,mx,p1,p2,mn,j;
   string s;
   vector<int>v1;
   vector<string>v2;
   cin>>t;
   while(t--)
   {
       mx=-1e9,mn=1e9;
      cin>>n;
      while(n--)
      {
          cin>>s>>a>>b>>c, d=a*b*c;
          v2.push_back(s);
          v1.push_back(d);
          }
          for( j=0;j<v1.size();j++)
          {
              if(v1[j]>mx)
                mx=v1[j],p1=j;
              if(v1[j]<mn)
                mn=v1[j],p2=j;
          }
          if(mx==mn)
            printf("Case %d: no thief\n",++i);
          else
            printf("Case %d: %s took chocolate from %s\n",++i,v2[p1].c_str(),v2[p2].c_str());

   }
    return 0;
}