#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <cmath>

#include <iostream>

#include <string>

#include <algorithm>

using namespace std;

#define FOR(i,s,t) for (int i = s; i < t; ++i)

#define MEM(s,v) memset(s, v, sizeof(s))

#define EPS 1e-8

#define _N 15

#define _M 105

#define PI acos(-1.0)

int even[], light[], heavy[];

char l[_N], r[_N], b[_N];

void set_union(int *a, char *b)

{

    FOR (i, , strlen(b)) { a[b[i] - 'A'] += ; }

}

int main()

{

    int n; scanf("%d", &n); while (n--) {

        MEM (even, ); MEM (light, ); MEM (heavy, );

        FOR (i, , ) {

            scanf("%s%s%s", l, r, b);

            if (b[] == 'e') {

                set_union(even, l);

                set_union(even, r);

            } else if (b[] == 'u') {

                set_union(heavy, l);

                set_union(light, r);

            } else {

                set_union(light, l);

                set_union(heavy, r);

            }

        }

        int _l[], _h[];

        FOR (i, , ) {

            _l[i] = light[i] * (!even[i] && light[i]);

            _h[i] = heavy[i] * (!even[i] && heavy[i]);

        }

        int max_c = , max_n = , _t = ;

        FOR (i, , ) if (_l[i] > max_n) {

            max_c = i; max_n = _l[i]; _t = -;

        }

        FOR (i, , ) if (_h[i] > max_n) {

            max_c = i; max_n = _h[i]; _t = ;

        }

        printf("%c is the counterfeit coin and it is %s.\n", max_c + 'A', _t == - ? "light" : "heavy");

    }

    return ;

}