#include <bits/stdc++.h>
using namespace std;


void solve()
{
    map<int,int> mp;
    int n,cnt=0,cao;
    cin>>n;
    cao=(n*2-2)/2;
    for(int i=1,a;i<=2*n;i++)
    {
        cin>>a;
        if(mp[a]>=1 ) cnt++;
        mp[a]++;
    }
    if(cao<cnt) cout<<"Qingyu"<<endl;
    else cout<<"Kevin"<<endl;
}

int main()
{
    int tt=1;
    cin>>tt;
    while(tt--) solve();
}

/*
3
3
1 1 4 5 1 4
2
1 2 3 4
4
1 2 2 3 2 1 1 4

*/