#include #define x first #define y second #define y0 hi1 #define y1 hi2 #define ll long long #define mp make_pair #define pb push_back #define sqr(a) (a)*(a) #define ld long double #define all(a) (a).begin(), (a).end() using namespace std; const int N = 100000; const int M = 6; const int inf = 2e9; int a[N][M]; int main(){ cin.tie(0); ios_base::sync_with_stdio(0); int T; cin >> T; while(T--){ int n; cin >> n; bool tie = 0; int ans = -inf, num = -1; for(int i = 0; i < n; i++){ int m; cin >> m; int a[M]; memset(a, 0, sizeof(a)); for(int j = 0; j < m; j++){ int x; cin >> x; a[x - 1]++; } sort(a, a + M); reverse(a, a + M); int r = a[0] + a[1] + a[2] + a[3] + a[4] + a[5] + (a[3] - a[4]) + (a[4] - a[5]) * 2 + a[5] * 4; if(r > ans){ tie = 0; ans = r; num = i + 1; } else if(r == ans){ tie = 1; } } if(tie){ cout << "tie\n"; } else { if(num == 1){ cout << "chef\n"; } else { cout << num << "\n"; } } } }