#include <bits/stdc++.h>

using namespace std;
using ll = long long;
#define x first
#define y second

void solve();

int main() {
#ifndef LOCAL
	cin.tie(nullptr)->sync_with_stdio(false);
#endif
	cout << fixed << setprecision(30);
	int t = 1;
	cin >> t;
	while (t--) {
		solve();
	}
}


void solve() {
	int n;
	cin >> n;
	map<int, int> cnt;
	for (int i = 0; i < 2 * n; ++i) {
		int x;
		cin >> x;
		cnt[x]++;
	}
	set<pair<int, int>> odd, even;
	for (auto [x, y] : cnt) if (y & 1) odd.emplace(y, x); else even.emplace(y, x);
	for (int i = 0; i < n - 1; ++i) {
		{
			int del;
			if (even.size()) {
				del = even.begin()->second;
				even.erase({cnt[del], del});
			} else {
				del = odd.begin()->second;
				odd.erase({cnt[del], del});
			}
			cnt[del]--;
			if (cnt[del] > 0) {
				if (cnt[del] & 1) odd.emplace(cnt[del], del);
				else even.emplace(cnt[del], del);
			}
		}
		{
			int del;
			if (odd.empty()) {
				del = even.begin()->second;
				even.erase({cnt[del], del});
			} else {
				del = odd.begin()->second;
				odd.erase({cnt[del], del});
			}
			cnt[del]--;
			if (cnt[del] > 0) {
				if (cnt[del] & 1) odd.emplace(cnt[del], del);
				else even.emplace(cnt[del], del);
			}
		}
	}
	if (even.size()) cout << "Qingyu\n";
	else cout << "Kevin\n";
}