#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector < int > vi ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

const int MAXN = 2e6 + 7 ;

int n ;
int a[ MAXN ] ;
int freq[ MAXN ] ;
vector < int > v ;

void solve ( ) {
    cin >> n ;
    for ( int i = 0 ; i <= 2 * n ; ++ i ) {
        freq[ i ] = 0 ;
    }
    for ( int i = 1 ; i <= 2 * n ; ++ i ) {
        cin >> a[ i ] ;
        ++ freq[ a[ i ] ] ;
    }
    v.clear ( ) ;
    int ones = 0 ;
    for ( int i = 1 ; i <= 2 * n ; ++ i ) {
        if ( freq[ i ] == 1 ) { ++ ones ; }
        else if ( freq[ i ] > 1 ) { v.push_back ( freq[ i ] ) ; }
    }
    sort ( v.begin ( ) , v.end ( ) ) ;
    int sz = v.size ( ) ;
    int tp = 0 ;
    for ( int ctr = 0 ; ctr < 2 * n - 2 ; ++ ctr ) {
        if ( ( ctr % 2 ) == 0 ) {
            if ( ones > 0 ) { -- ones ; }
            else {
                if ( tp < sz && v[ tp ] > 1 ) {
                    -- v[ tp ] ;
                    if ( v[ tp ] == 1 ) { ++ tp ; ++ ones ; }
                }
            }
        }
        else {
            if ( tp < sz && v[ tp ] > 1 ) {
                -- v[ tp ] ;
                if ( v[ tp ] == 1 ) { ++ tp ; ++ ones ; }
            }
            else { -- ones ; }
        }
    }
    if ( ones == 0 ) { cout << "Qingyu\n" ; }
    else { cout << "Kevin\n" ; }
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; cin >> t ;
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}