#include<iostream>
#include<map>
#include<cmath>
#include<string>
#include<vector>
#include<cstring>
#include<algorithm>
#include<unordered_map>

#define pb push_back
#define fi first
#define se second
#define int long long
#define all(x) (x).begin(),(x).end()
#define _for(i, a) for(int i = 0; i < (a); ++i) 
#define _rep(i, a, b) for(int i = (a);i <= (b); ++i)
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define u1 (u<<1)
#define u2 (u<<1|1)
//#define endl '\n'
using namespace std;
typedef pair<int,int> PII;

const int INF=0x3f3f3f3f;
const int P=1e9+7;
const int N=2e6+20,M=2*N;
int n,m,k,q[N],cun[N];
void solve(){
	cin>>n;
	int sum=0,cnt=0;
	_rep(i,1,2*n)cun[i]=0;
	_rep(i,1,2*n)
	{
		cin>>q[i];
		cun[q[i]]++;
	}
	_rep(i,1,2*n)
	{
		if(cun[q[i]]==1)cnt++;
		else sum+=cun[q[i]];
	}
	if(cnt>=sum)cout<<"Kevin\n";
	else cout<<"Qingyu\n";	
}
signed main(){
	IOS;
	int T=1;
	cin>>T;
	_rep(i,1,T){
		solve();
	}
	return 0;
}