#include <cstdio>
#include <queue>
#include <algorithm>
using namespace std;
class priority_queue<int,vector<int>,greater<int> > T[120];
int main()
{
	freopen("poker1.in","r",stdin);
	freopen("poker1.out","w",stdout);
	int n,m,temp,ans,num,temp2;
	scanf("%d",&m);
	for(int i=1;i<=m;i++)
	{
		scanf("%d",&n);
		for(int j=1;j<=n;j++)
		{
			scanf("%d",&temp);
			T[i].push(temp);
		}
		temp=120;
		num=0;ans=0;
		bool o=true;
		while(!T[i].empty())
		{
			
			temp2=T[i].top();
			T[i].pop();
			if(temp!=temp2)
				{
					temp=temp2;
					num=1;
				}
			else num++;	
			if(num==4) ans=temp;
			if(num>4) {printf("cheat\n");o=false;break;}
			if(ans>=3) {printf("%d\n",ans);break;}
			
		}
		if(ans==0) printf("no bomb\n");
		else if(ans<=2&&o) printf("%d\n",ans);
	}
	fclose(stdin);
	fclose(stdout);
	return 0;
}