#include<cstdio>
#include<cstring>
#include<vector>
#include<stack>
#include<cctype>
#include<cmath>
#include<algorithm>
#include<iostream>
#include<queue>
#include<time.h>
#define ll long long
using namespace std;
/*maaaarrrrrx*/
int m,n,a[25];

int main()
{
//	freopen("i.txt","r",stdin);
	freopen("poker1.in","r",stdin);
	freopen("poker1.out","w",stdout);
	scanf("%d",&m );
	for(int k=1;k<=m;k++)
	{
		scanf("%d",&n);
		for(int i=1;i<=n;i++)	scanf("%d",a+i);
		sort(a+1,a+1+n);
		int cnt=1,ans=-1;
		int ok=0;
		int flag=0;
		for(int i=1;i<=n;i++)
		{
			if(a[i]<=2)	flag=i;
			else break;
		}
		for(int i=flag+1;i<=n;i++)
		{
			if(a[i]==a[i-1])	cnt++;
			if(a[i]!=a[i-1] || i==n) 
			{
				if(cnt==4)	{ok=1;ans=a[i-1];}
				else if(cnt>4)	{ok=2;cout<<"cheat"<<endl;break;}
				cnt=1;
			}
		}
		if(cnt==4)	ans=a[n],ok=1;;
		if(cnt>=5)	ok=2;
		cnt=1;
		if(ok==0)
		{
			sort(a+1,a+flag+1);
			for(int i=1;i<=flag;i++)
			{
				if(a[i]==a[i-1])	cnt++;
				if(a[i]!=a[i-1] || i==n)
				{
					if(cnt==4)
					{ok=1;ans=a[i-1];}
					else if(cnt>4)	{ok=2;cout<<"cheat"<<endl;break;}
					cnt=1;
				}
			}
		}
		if(cnt==4)	ans=a[flag],ok=1;
		if(cnt>=5)	ok=2;
		
		if(ok==1)	cout<<ans<<endl;
		if(ok==0)	cout<<"no bomb"<<endl;
	}
	return 0;
}