#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int vis[60];
void solve()
{
	int n;
	int ok=0;
	int minn=100;
	scanf("%d",&n);
	memset(vis,0,sizeof(vis));
	for(int i=1;i<=n;i++)
	{
		
		int x;
		scanf("%d",&x);
		if(x==1) x=50/x;
		if(x==2) x=50/x;
		vis[x]++;	
		if(vis[x]>4) ok=2;
		if(vis[x]==4){
			if(ok==0) ok=1;
			minn=min(minn,x);
		}
	}
	if(ok==2) printf("cheat\n");
	if(ok==0) printf("no bomb\n");
	if(ok==1) printf("%d\n",minn>13 ? 50/minn : minn);
	
	return ;
}
int main(){
freopen("poker1.in","r",stdin);
freopen("poker1.out","w",stdout);
	int t;
	scanf("%d",&t);
	for(int i=1;i<=t;i++)
	 solve();
	return 0;
}