#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
#include<cstring>
using namespace std;

int read()
{
    int f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9'){if(ss=='-')f=-1;ss=getchar();}
    while(ss>='0'&&ss<='9'){x=x*10+ss-'0';ss=getchar();}
    return x*f;
}

void print(int x)
{
    if(x<0){putchar('-');x=-x;}
    if(x>9)print(x/10);
    putchar(x%10+'0');
}

int t,n;
bool judge,test;
int d[14]={1e9,13,12,1,2,3,4,5,6,7,8,9,10,11};
int rem=0;
int cnt[100];

int main()
{
	freopen("poker1.in","r",stdin);
	freopen("poker1.out","w",stdout);
	
	t=read();
	while(t--)
	{
		n=read(); judge=false; test=true;
		rem=0;
		memset(cnt,0,sizeof(cnt));
		for(int i=1;i<=n;i++)
		{
			int k=read();
			cnt[k]++;
			if(cnt[k]>4) { printf("cheat\n"); test=false;}
			if(test&&cnt[k]==4)
			{
				judge=true;
				if(d[k]<d[rem])rem=k;
			}
		}
		if(judge&&test){print(rem);printf("\n");}
		else if(!judge&&test) printf("no bomb\n");
	}
	fclose(stdin);
	fclose(stdout);
	
	return 0;
}