#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe;
ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
void write(ll x){
    if(x<0)putchar('-'),x=-x;
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
const ll N=2e6+9;
ll T,n,a[N],tag[N];
vector<ll>v[N];
void solve(){
    n=read();
    rep(i,0,n*2+1)v[i].clear(),tag[i]=0;
    rep(i,1,n*2)a[i]=read(),tag[a[i]]++;
    ll o=max_element(tag+1,tag+n*2+1)-tag;
    tag[o]--;
    if(*max_element(tag+1,tag+n*2+1)>=max(2ll,n-1))puts("Qingyu");
    else puts("Kevin");
}
bool Med;
int main(){
    cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
    T=read();
    while(T--)solve();
    return 0;
}