#include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
    int n;
    cin >> n;
    map<int,int> cnt;
    for (int i = 1;i <= 2 * n;i++){
        int a;
        cin >> a;
        cnt[a]++;
    }
    int one = 0;
    priority_queue<int> q;
    for (auto [a,c] : cnt){
        if (c == 1) one++;
        else{
            q.push(c);
        }
    }
    int t = 0;
    while (!q.empty() || one){
        if (q.size() == 1 && q.top() == 2){
            cout << "Qingyu\n";
            return;
        }
        if (!t){
            if (q.empty()) one--;
            else{
                int x = q.top();
                x--;
                q.pop();
                if (x == 1) one++;
                else q.push(x);
            }
        }else{
            if (one) one--;
            else{
                int x = q.top();
                x--;
                q.pop();
                if (x == 1) one++;
                else q.push(x);
            }
        }
        t ^= 1;
    }
    cout << "Kevin\n";
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T;
    cin >> T;
    while (T--) {
        solve();
    }

    return 0;
}