#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int a[N];
map<int, int> st;
signed main()
{
    int T, n, x;
    cin >> T;
    while (T--)
    {
        int res = 0, fg = 1, sum = 0, cnt = 0;
        cin >> n;
        for (int i = 1; i <= 2 * n; i++)
        {
            cin >> a[i];
            st[a[i]]++;
        }
        for (int l = 1, r = 2 * n; l < r; l++, r--)
        {
            if (a[l] != a[r])
                fg = 0;
        }
        if (fg)
        {
            puts("Qingyu");
        }
        else
        {
            for (auto p : st)
            {
                if (p.second == 1)
                    res++;
                else
                    sum += p.second, cnt++;
            }
            if (sum - (cnt - 1) * 2 <= res)
                puts("Kevin");
            else
                puts("Qingyu");
            st.clear();
        }
    }
}