#include<bits/stdc++.h>
using namespace std;
#define int long long
#define i64 long long
#define LL long long
#define i128 __int128
#define ull unsigned long long
#define db long double 
#define PII pair<int,int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define lowbit(x) ((x)&-(x))
#define debug(x) cout<<(#x)<<" = "<<(x)<<'\n'

const double eps=1e-8;
const int mod=1e9+7;
//const int mod=998244353;
const int inf=1e9+7;
const i64 INF=1e9+7;
const int N=1e5+5;
const int M=1e6+5;

//const int g=3;
//const int gi=332748118;

LL qmi(LL a,int b){
	a=(a%mod+mod)%mod;
	LL ret=1;
	for(;b;b>>=1,a=a*a%mod)if(b&1)ret=ret*a%mod;
	return ret;
}
int Sqrt(int x){
	assert(x>=0);
	int t=sqrt(x);
	while((t+1)*(t+1)<=x)t++;
	while(t*t>x)t--;
	return t;
}



int n;
int m;
int a[N],b[N];

inline void solve(){
	cin>>n;
	map<int,int>cnt;
	for(int i=0;i<n*2;i++){
		int x;cin>>x;
		a[i]=x;
		cnt[x]++;
	}
	int ok=0;
	for(int i=0;i<n;i++){
		if(a[i]!=a[n*2-i-1]){
			ok=1;break;
		}
	}
	if(!ok){
		cout<<"Qingyu\n";
		return;
	}
	int c=0;
	for(auto t:cnt){
//		debug(t.fi);
//		debug(t.se);
		c+=t.se==1;
	}
//	debug(c);
	if(c*2<=n)cout<<"Qingyu\n";
	else cout<<"Kevin\n";
}
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int _=1;
	cin>>_;
	while(_--)solve();
	return 0;
}
/*

*/