#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <string>
#include <assert.h>
using namespace std;


/*int dp[17][1<<17];
int n;
int arr[111];*/

int readPosIntLn(){
	int x=0;
	int cnt=0;
	int fi=-1;
	while(true){
		char g=getchar();
		if('0'<=g && g<='9'){
			x*=10;
			x+=g-'0';
			if(cnt==0){
				fi=g-'0';
			}
			cnt++;
			assert(!(cnt>10 || ( cnt==10 && fi>1) ));
		} else if(g=='\n'){
			return x;
		} else {
			assert(false);
		}
	}
}
 
int readPosIntSpace(){
	int x=0;
	int cnt=0;
	int fi=-1;
	while(true){
		char g=getchar();
		if('0'<=g && g<='9'){
			x*=10;
			x+=g-'0';
			if(cnt==0){
				fi=g-'0';
			}
			cnt++;
			assert(!(cnt>10 || ( cnt==10 && fi>1) ));
		} else if(g==' '){
			return x;
		} else {
			assert(false);
		}
	}
}
 
string readStringLn(){
	string ret="";
	while(true){
		char g=getchar();
		assert(g!=-1);
		if(g=='\n'){
			break;
		}
		
		ret+=g;
	}
	return ret;
}


int n;
int a[100100];
string st;
int T;
int main(){
	//freopen("08.txt","r",stdin);
	//freopen("08o.txt","w",stdout);
	//cin>>T;
	T=readPosIntLn();
	assert(1<=T && T<=100000);
	int sm=0;
	while(T--){
		//cin>>n>>st;
		n=readPosIntSpace();
		sm+=n;
		assert(1<=n && n<=100000);
		assert(1<=sm && sm<=100000);
		st=readStringLn();
		assert(st=="Chef" || st=="Chefu");
		for(int i=0;i<n;i++){
			if(i==n-1){
				a[i]=readPosIntLn();
			} else {
				a[i]=readPosIntSpace();

			}
			assert(1<=a[i] && a[i]<=50);
			//cin>>a[i];
		}
		if(n%2 && st == "Chefu"){
			cout<<"Chef"<<endl;
			continue;
		}
		if(n%2==0 && st == "Chef"){
			cout<<"Chef"<<endl;
			continue;
		}
		int ans=0;
		int cur=0;
		for(int j=0;j<n;j++){
			if(a[j]%2){
				cur++;
			} else {
				ans += (cur+1)/2;
				cur=0;
			}
		}
		ans += (cur+1)/2;
		if(ans > (n-1)/2){
			cout<<"Chefu"<<endl;
		} else {
			cout<<"Chef"<<endl;
		}
	}
	assert(getchar()==-1);
	return 0;


	/*dp[1][0]=0;
	dp[1][1]=1;
	for(int i=2;i<=15;i++){
		for(int j=0;j<(1<<i);j++){
			if(i%2){ // 0's turn
				dp[i][j]=1;
				for(int k=0;k<i-1;k++){
					int bit0=0;
					int bit1=0;
					for(int u=i-1;u>=0;u--){
						
						if(u==k)continue;
						bit0*=2;
						bit1*=2;
						if(u==k+1){
							bit1++;
							continue;
						}
						if(j & (1<<u)){
							bit0++;
							bit1++;
						}
					}
					if(dp[i-1][bit0]==0)dp[i][j]=0;
					if( ((j&(1<<k)) || (j&(1<<(k+1)))) && dp[i-1][bit1]==0)dp[i][j]=0;
				}
			} else {
				dp[i][j]=0;
				for(int k=0;k<i-1;k++){
					int bit0=0;
					int bit1=0;
					for(int u=i-1;u>=0;u--){
						
						if(u==k)continue;
						bit0*=2;
						bit1*=2;
						if(u==k+1){
							bit1++;
							continue;
						}
						if(j & (1<<u)){
							bit0++;
							bit1++;
						}
					}
					if(dp[i-1][bit0]==1)dp[i][j]=1;
					if( ((j&(1<<k)) || (j&(1<<(k+1)))) && dp[i-1][bit1]==1)dp[i][j]=1;
				}
			}
		}
	}
	cin>>n;
	for(int i=0;i<(1<<n);i++){
		for(int j=0;j<n;j++){
			if(i&(1<<j)){
				cout<<"1 ";
			} else {
				cout<<"0 ";
			}
		}
		cout<<"Winner: "<<dp[n][i]<<" ";
		cout<<endl;
		int ans=0;
		int cur=0;
		for(int j=0;j<n;j++){
			if(i&(1<<j)){
				cur++;
			} else {
				ans += (cur+1)/2;
				cur=0;
			}
		}
		ans += (cur+1)/2;
		if(ans > (n-1)/2){
			if(dp[n][i]==0){
				cout<<"ER";
			}
			//cout<<"Winner: 1";
		} else {
			if(dp[n][i]==1){
				cout<<"ER";
			}
			//cout<<"Winner: 0";
		}
		//cout<<endl;
	}
	cout<<"EMD";
	while(cin>>n){
		int bit=0;
		for(int i=0;i<n;i++){
			cin>>arr[i];
			bit*=2;
			bit+=arr[i];
		}
		cout<<dp[n][bit]<<endl;
	}*/
	
}