#include <cstdio>

using namespace std;

const int N = 2e6 + 500;

int n, A[N], cnt[N], cnt2[N];

int solve() {
	scanf("%d", &n);
	for(int i = 0;i <= 2 * n;i++) cnt[i] = 0, cnt2[i] = 0;
	for(int i = 0;i < 2 * n;i++) {
		scanf("%d", A + i);
		cnt[A[i]]++;
	}
	bool ok = 1;
	for(int i = 0;i < n;i++)
		if(A[i] != A[2 * n - i - 1]) ok = 0;
	if(ok) {
		printf("Qingyu\n");
		return 0;
	}
	for(int i = 0;i <= 2 * n;i++) {
		if(cnt[i]) cnt2[cnt[i]]++;
	}
	int L = 0, R = 2 * n;
	for(int i = 0;i < n;i++) {
		while(!cnt2[L]) L++;
		while(!cnt2[R]) R--;
		cnt2[R]--;
		if(i == n - 1) break;
		if(R - 1) cnt2[R - 1]++;
		while(!cnt2[L]) L++;
		while(!cnt2[R]) R--;
		if(L == R && cnt2[L] == 1) {
			printf("Qingyu\n");
			return 0;
		}
		while(!cnt2[L]) L++;
		while(!cnt2[R]) R--;
		cnt2[L]--;
		if(L - 1) cnt2[--L]++;
		while(!cnt2[L]) L++;
		while(!cnt2[R]) R--;
		if(L == R && cnt2[L] == 1) {
			printf("Qingyu\n");
			return 0;
		}
	}
	printf("Kevin\n");
	return 0;
}

int main() {
	int T; scanf("%d", &T);
	for(;T--;) solve();
	return 0;
}