#include <cstdio>

 #include <cstring>

 #include <cmath>

 #include <cstdlib>

 #include <algorithm>

 #include <string>

 #include <iostream>

 #include <stack>

 #include <map>

 #include <queue>

 #include <set>

 using namespace std;

 typedef long long LL;

 #define N 100010

 #define INF 0x3f3f3f3f

 int s[] = {, , , , , , , };

 int mp1[], mp2[];

 int main()

 {

     , ;

     int t;

     scanf("%d", &t);

     while(t--) {

         int red = , bla = ;

         memset(mp1, , sizeof(mp1));

         memset(mp2, , sizeof(mp2));

         int n; char str[];

         for(int i = ; i <= ; i++) {

             scanf("%d", &n);

             if(i == ) {

                 for(int j = ; j < n; j++) {

                     scanf("%s", str);

                     red += s[str[]-'A'+];

                     mp1[str[]-'A'+]++;

                 }

             } else {

                 for(int j = ; j < n; j++) {

                     scanf("%s", str);

                     bla += s[str[]-'A'+];

                     mp2[str[]-'A'+]++;

                 }

             }

         }

         if(mp1[] ==  || mp1[] == ) if(red > ) red--;

         if(mp2[] ==  || mp2[] == ) if(bla > ) bla--;

         if(red == bla) puts("tie");

         else if(red < bla) puts("black");

         else puts("red");

     }

     return ;

 }