#include<bits/stdc++.h>

#define ll long long
#define pi pair<int,int>
#define vi vector<int>
#define cpy(x,y,s) memcpy(x,y,sizeof(x[0])*(s))
#define mset(x,v,s) memset(x,v,sizeof(x[0])*(s))
#define all(x) begin(x),end(x)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ary array
#define IL inline

#define mod 998244353
#define N 2000005

using namespace std;
int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0' || ch>'9')f=(ch=='-'?-1:f),ch=getchar();
    while(ch>='0' && ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    return x*f;
}
void write(int x){
    if(x<0)x=-x,putchar('-');
    if(x/10)write(x/10);
    putchar(x%10+'0');
}

int c[N],buc[N],a[N];

void solve(){
    int n=read();
    for(int i=1;i<=2*n;i++)buc[i]=0;
    for(int i=1;i<=2*n;i++)a[i]=read(),buc[a[i]]++;
    int cnt=0,tot=0;
    for(int i=1;i<=2*n;i++){
        if(buc[i]){
            if(buc[i]==1)cnt++;
            else c[++tot]=buc[i];
        }
    }
    sort(c+1,c+tot+1);
    int flag=0;
    for(int i=1;i<=tot;i++){
        if(c[i]<cnt)cnt-=(c[i-1]),cnt++;
        else if(c[i]==cnt){
            if(i!=tot){flag=1;break;}
            else break;
        }
        else{
            if(c[i]==cnt+1)cnt=1;
            else {flag=1;break;}
        }
    }
    if(flag)printf("Qingyu\n");
    else printf("Kevin\n");
}

int main(){
    #ifdef EAST_CLOUD
    freopen("a.in","r",stdin);
    freopen("a.out","w",stdout);
    #endif

    int T=read();while(T--)solve();

}
//cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
//cerr<<"\n"<<clock()*1.0/CLOCKS_PER_SEC*1000<<"ms\n";