1 //2017-08-19
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <iostream>
 5 #include <algorithm>
 6 
 7 using namespace std;
 8 
 9 const int N = 3050;
10 bool G[N][N];
11 int n;
12 
13 void work(){
14     for(int i = 1; i <= n; i++){
15         for(int j = i+1; j <= n; j++){
16             if(G[i][j] == 1){
17                 for(int k = j+1; k <= n; k++){
18                     if(G[i][k] == 1 && G[j][k] == 1){
19                         printf("Bad Team!\n");return;
20                     }
21                 }
22             }
23             if(G[i][j] == 0){
24                 for(int k = j+1; k <= n; k++){
25                     if(G[i][k] == 0 && G[j][k] == 0){
26                         printf("Bad Team!\n");return;
27                     }
28                 }
29             }
30         }
31     }
32     printf("Great Team!\n");
33 }
34 
35 int main()
36 {
37     int T, a;
38     scanf("%d", &T);
39     while(T--){
40         scanf("%d", &n);
41         for(int i = 1; i <= n-1; i++){
42             for(int j = i+1; j <= n; j++){
43                 scanf("%d", &a);
44                 G[j][i] = G[i][j] = a;
45             }
46         }
47         work();
48     }
49 
50     return 0;
51 }