#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 10;
int a[N] = {};
void solve()
{
    int n, x, ans = 0;
    cin >> n;
    scanf("%d", &n);
    memset(a, 0, sizeof(a));
    for (int i = 1; i <= n * 2; i++)
    {
        scanf("%d", &x);
        a[x]++;
    }
    for (int i = 1; i <= 2 * n; i++)
    {
        ans += a[i] > 0;
        if (ans > n)
        {
            printf("Kevin\n");
            return;
        }
    }
    printf("Qingyu\n");
}
signed main()
{
    int T;
    scanf("%d", &T);
    while (T--)
    {
        solve();
    }
    return 0;
}