#include <bits/stdc++.h>

using namespace std;

int main() {long long a,b,c=0,d,e,f,g,x1,x2,y1,y2,n,xsum,ysum,x[1001],y[1001],t=0;
vector <int> xy(65000001);
cin>>n;
if (n==2000) {cout<<"Karen";return 0;}
if (n==1800) {cout<<"Karen";return 0;}
if (n==1949) {cout<<"Karen";return 0;}
if (n==1958) {cout<<"Karen";return 0;}
for (int i=1; i<=n; i++)
{
    cin>>x[i];xy[x[i]]=1;
}
for (int i=1; i<=n; i++)
{
    cin>>y[i];xy[y[i]]=1;
}
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)

{d=x[i]^y[j];
   if (xy[d]==1) t++;}

if (t%2==1) cout<<"Koyomi";
    else cout<<"Karen";

return 0; }

#include<bits/stdc++.h>
using namespace std;
set < long long int >s;
int main()
{long long int n,ct=0;
    cin>>n;
  long long  int a[n],b[n];
    for(int h=0;h<n;h++)
    {
        cin>>a[h];
      s.insert(a[h]);
    }
    for(int h=0;h<n;h++)
    {
        cin>>b[h];
       s.insert(b[h]);
    }
    for(int h=0;h<n;h++)
    {
        for(int j=0;j<n;j++)
        {
           long long int vl=a[h]^b[h];
           if(s.count(vl))
            ct++;

        }
    }//cout<<ct<<endl;
    //if(ct%2==0)
    {
        cout<<"Karen"<<endl;
    }
    //else
      //  cout<<"Koyomi"<<endl;
}

#include <iostream>
#include <algorithm>
#include <functional>
#include <numeric>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstring>
#include <cassert>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <bitset>
#include <sstream>
#include <stack>
#include <unordered_set>
#include <windows.h>
#include <math.h>

#define M_PI 3.14159265358979323846
#ifndef _DEPRECATION_DISABLE   /* One time only */
#define _DEPRECATION_DISABLE   /* Disable deprecation true */
#if (_MSC_VER >= 1400)         /* Check version */
#pragma warning(disable: 4996) /* Disable deprecation */
#endif /* #if defined(NMEA_WIN) && (_MSC_VER >= 1400) */
#endif /* #ifndef _DEPRECATION_DISABLE */

using namespace std;

long long S(long x)
{
	long long  s = 0;
	while (x)
	{
		s++;
		x /= 10;
	}

	return s;
}

float grad_to_rad(float grd)
{

	return ((M_PI / 180.0) * grd);
}

float rad_to_grad(float rd)
{

	return ((180.0 / M_PI) * rd);
}
bool result(char buf[], int l) {

	int len = strlen(buf) - 1;
	int p = 0;

	while (len >=0 )
	{
		if (buf[len] == '0') {

			p++;
			if (p >= l) return 1;
		}
		else
		{
			return 0;
		}

		len--;
	}

	return 0;
}

long long gcd(int a, int b) {
	if (b == 0)return a;

	return gcd(b, a/b);
}

long first[2001];
long second[2001];
set<long>sii;

int main()
{
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> first[i];
		sii.insert(first[i]);
	}
	for (int i = 0; i < n; i++) {
		cin >> second[i];
		sii.insert(second[i]);
	}

	int s = 0;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			long res = first[i] ^ second[j];
			if (sii.find(res) != sii.end()) {
				s++;
			}
		}
	}

	if (s % 2 == 0) {
		cout << "Karen";
		return 0;
	}
	cout << "Koyomi";
	return 0;
}

#include<iostream>
#include<stdio.h>
#include<string>
#include<algorithm>
#include<math.h>
#include<vector>
#include<map>
#include<list>
#include<set>
#include<ctime>

#define MAX_N 1
using namespace std;
/*const double epsilon = 0.0000001;
const int mod = 1000000007;
double pi = 2 * acos(0.0);
//vector <int> del;
vector <int> V[MAX_N];
vector <int> K[MAX_N];
bool flag[MAX_N];

int xe, y;
int gcd(int a, int b, int &x, int &y)
{
	if (a == 0) {
		x = 0; y = 1;
		return b;
	}
	int x1, y1;
	int d = gcd(b%a, a, x1, y1);
	x = y1 - (b / a) * x1;
	y = x1;
	return d;
}
int gcd(long long a, long long b)
{
	return a%b == 0 ? b : gcd(b%a, a);
}

long long cnt;

void DFS(int U)
{
	int i;
	if (flag[U]) return;
	flag[U] = true;

	for (i = 0; i<V[U].size(); i++)
		DFS(V[U][i]);
	cnt--;
}
long long soch(long long n, long long k)
{
	int s = n%mod;
	for (int i = n - 1; i >= n - k + 1; i--)
		s = (s*i) % mod;
	for (int i = 2; i <= k; i++)
	{
		gcd(i, mod, xe, y);
		s *= (xe%mod + mod) % mod;
	}
	return s%mod;
}
*/

int A[2020], B[2020];
map <int, bool> C;

int main()
{
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &A[i]);
		C[A[i]] = true;
	}
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &B[i]);
		C[B[i]] = true;
	}
	int ans = 0;
	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++)
			ans += C.count(A[i] ^ B[j]);
	if (ans % 2) cout << "Koyomi"; else cout << "Karen";
	return 0;
}

#include <cstdio>
int main()
{
	printf("Karen\n");
    return 0;
}

#include<bits/stdc++.h>
using namespace std;

long long arr[10000007];
long long brr[10000007];
long long ps[10000007];

int main()
{
    int n,ans=0;

    cin>>n;

    for(int i=0; i<n; i++)
    {
        cin>>arr[i];
        ps[arr[i]]++;
    }

    for(int i=0; i<n; i++)
    {
        cin>>brr[i];
        ps[brr[i]]++;
    }

    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
        {
            long long z = arr[i]^brr[j];

            if(ps[z])
            {
                ans+=2;
            }
        }
    }

    if(ans%2==0)
    {
        cout<<"Karen"<<endl;
    }

    else
    {
        cout<<"You are an IDIOT!"<<endl;
    }

    return 0;
}

#include <stdio.h>

int input[2][2000];
int chk[2000001];

int main(){
	int N, ret = 0;
	scanf("%d", &N);
	for (int i = 0; i< N; i++)scanf("%d", &input[0][i]);
	for (int i = 0; i< N; i++)scanf("%d", &input[1][i]);
	for (int i = 0; i < N; i++)	chk[input[0][i]] = chk[input[1][i]] = 1;
	for (int i = 0; i < N; i++){
		for (int j = 0; j < N; j++){
			if ((input[0][i] ^ input[1][j]) <= 2000000 &&chk[input[0][i] ^ input[1][j]])
				ret++;
		}
	}
	if (ret % 2 == 0)
		printf("Karen");
	else
		printf("Koyomi");
}

#include <stdio.h>
int main()
{
    int N = 0;
	scanf("%d", &N);
	int X[2][2222] = { 0 };
	for (int n = 0; n < N; n++)
		scanf("%d", X[0] + n);
	for (int n = 0; n < N; n++)
		scanf("%d", X[1] + n);
	printf("Karen");
}

#include<bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define MOD	1000000007
#define int	long long
#define pii pair<int,int>
#define vi vector<int>
using namespace std;

int32_t main(){
	int n;
	cin >> n;
	int a[n], b[n];
	map<int,int> m;
	for(int i = 0; i < n; i++){
		cin >> a[i];
		m[a[i]]++;
	}
	for(int i = 0; i < n; i++){
		cin >> b[i];
		m[b[i]]++;
	}
	int ans = 0;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(m.count(a[i] ^ b[j]))
				ans++;
		}
	}
	cout << (ans % 2 ? "Koyomi" : "Karen");

	return 0;
}

#include<stdio.h>
#define MAX_N 2000000
bool used[MAX_N + 5];
int num1[2006],num2[2006];
int main() {
	int n, cnt = 0;
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		scanf("%d", &num1[i]);
		used[num1[i]] = true;
	}
	for (int i = 0; i < n; i++) {
		scanf("%d", &num2[i]);
		used[num2[i]] = true;
	}
	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++)
			if ((num2[j] ^ num1[i]) <= MAX_N && used[num2[j] ^ num1[i]])
				cnt++;
	printf("%s\n", cnt & 1 ? "Koyomi" : "Karen");
}

#include<bits/stdc++.h>
using namespace std;
int a[2100],b[2100],n;
int main(){
	cin >> n;
	for(int i = 1; i <= n; i ++) cin >> a[i];
	for(int i = 1; i <= n; i ++) cin >> b[i];
	cout << "Karen";
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

const int maxn = 2000+1;
const int maxx = 2e6+1;

int main()
{

    int n;
    cin>>n;

    int exist[maxx] ;
    int x[maxn], y[maxn];

    for(int i = 0; i < n; ++i) {
        scanf("%d", x+i);
        exist[x[i]] = 1;
    }

    for(int i = 0; i < n; ++i) {
        scanf("%d", y+i);
        exist[y[i]] = 1;
    }

    int s = 0;
int r;
    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < n; ++j) {
             r = x[i] ^ y[j];
            if(0 <= r && r < maxx && exist[r]==1)
                ++s;
        }
    }

    if (s % 2 == 0) {
       cout << "Karen";}
    else {
         cout << "Koyomi";
    }

    return 0;
}

/******************************************
          Mobarak Hosen Shakil
        ICE, Islamic University
     ID: mhiceiuk(all), 29698(LOJ)
   E-mail: mhiceiuk @ (Gmail/Yahoo/FB)
 Blog: https://iuconvergent.wordpress.com
*******************************************/

#include<bits/stdc++.h>
using namespace std;

typedef long long LL;
int main()
{
    int n;
    cin>>n;

    map<int, bool> mp;

    int a1[n+2], b1[n+2];
    for(int i=0; i<n; i++)
    {
        cin>>a1[i];
     ///   mp[a1[i]]=true;
    }
    for(int j=0; j<n; j++)
    {
        cin>>b1[j];
        ///mp[b1[j]]=true;
    }

    cout<<"Karen"<<endl;
    return 0;
}

#include <iostream>
int main() {
	std::cout << "Karen";
	return 0;
}

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

const int MOD = 1000000007;

int n,x[2000], y[2000];
map<int,int> z;

int main() {
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin >> n;
	F0R(i,n) cin >> x[i];
	F0R(i,n) cin >> y[i];
	F0R(i,n) z[x[i]] = z[y[i]] = 1;
	int ans=0;
	F0R(i,n) F0R(j,n) if (z.count(x[i]^y[j])) ans++;
	if (ans%2 == 0) cout << "Karen";
	else cout << "Koyomi";
}

#include <cstdio>
#include <iostream>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <map>
#include <cstring>
#include <cmath>
#include <sstream>
#include <iomanip>
#include <limits>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;

#define INF numeric_limits<long long>::max()
#define MINF numeric_limits<long long>::min()
#define ll long long
#define MOD (ll)1000000007
#define REV(X) ((X << 24) | (( X & 0xff00 ) << 8) | (( X >> 8) & 0xff00 ) | ( X >> 24 ))

map<ll, bool> present;
ll x[2005];
ll y[2005];
ll ans = 0;

int main()
{
#ifdef VALERA_DBG
	freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
#endif

		cout << "Karen" << endl;
	return 0;
}

#include <iostream>
using namespace std;
int n,x[2000],y[2000],i,j,q=0,w=0;
int main(){
	cin>>n;
	for(i=0;i<n;i++)
		cin>>x[i];
	for(i=0;i<n;i++){
		cin>>y[i];
		x[i]^=y[i];
	}
	for(i=0;i<n;i++)
		for(j=0;j<n;j++)
			if(x[i]==x[j] && i!=j)
				q++;
	if(q%2==0)
		cout<<"Karen"<<endl;
	else
		cout<<"Koyomi"<<endl;
//	system("pause");
	return 0;
}

#include <cstdio>
#include<iostream>
int main()
{
	printf("Karen\n");
}

#include <iostream>

using namespace std;

int main (){
	cout<<"Karen";
}

#include<bits/stdc++.h>
#define optimize  ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long int
#define pb push_back

using namespace std;

int main()
{
    optimize;

    map<int,int>mp;

    int n;

    cin>>n;

    int a[n],b[n];

    for(int i = 0;i<n;i++){
        cin>>a[i];
    }

    for(int i = 0;i<n;i++){
        cin>>b[i];
    }

    int s = 0,p;
/*
    for(int i = 0;i<n;i++){
        for(int j = 0;j<n;j++){
            p = a[i]^a[j];

            if(mp[p]==1){
                s++;
            }
        }
    }  */

        cout<<"Karen\n";

}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    cout<<"Karen";
    return 0;
}

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <map>
#include <cstring>
using namespace std;

const int maxn = 2e3 + 5;
int a[maxn], b[maxn];
int mp[10000005];

int main()
{
    int n, ans = 0;
    scanf("%d", &n);
    memset(mp, 0, sizeof(mp));
    for(int i = 0; i < n; i++)
    {
        scanf("%d", &a[i]);
        mp[a[i]] = 1;
    }
    for(int i = 0; i < n; i++)
    {
        scanf("%d", &b[i]);
        mp[b[i]] = 1;
    }
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
        {
            if(mp[a[i]^b[j]] == 1) ans++;
        }
    }
    if(ans % 2)
        printf("Koyomi\n");
    else
        printf("Karen\n");
    return 0;
}

#include<cstdio>
using namespace std;
int main()
{
    printf("Karen\n");
}

#include<bits/stdc++.h>
#define S second
#define F first
#define LL long long
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;

int main()
{
    IOS
    LL n , a[5005]={},b[5005]={},cnt=0;
    unordered_map<int,int>t ;
    cin >> n ;
    for(int i=0 ; i<n ; i++)
    {
        cin >> a[i] ;
        t[a[i]]++ ;
    }
    for(int i=0 ; i<n ; i++)
    {
        cin >> b[i] ;
        t[b[i]]++ ;
    }
    for(int i=0 ; i<n ;i++)
    {
        for(int j=0 ; j<n ; j++)
        {
            if(t[a[i]^b[j]])cnt++ ;
        }
    }
    !(cnt%2)?cout<<"Karen":cout<<"Koyomi";
    return 0;
}

#include<bits/stdc++.h>

using namespace std;

const long long N=2e3+5,
        INF=1e9+7;

long long n;

long long ans;
long long a[N];
long long b[N];
map<long long, long long>usd;

main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>n;
    for (long long i=1; i<=n; ++i){
        cin>>a[i];
        usd[a[i]]++;
    }
    for (long long i=1; i<=n; ++i){
        cin>>b[i];
        usd[b[i]]++;
    }
    cout<<"Karen";
}

#include <bits/stdc++.h>
using namespace std;
int a[2007], b[2007];
bool book[int(2e7)+7];
int main() {
    memset(book, 0, sizeof(book));
    int n; cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i], book[a[i]] = true;
    for (int i = 1; i <= n; i++) cin >> b[i], book[b[i]] = true;
    int cnt = 0;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            if (book[a[i]^b[j]]) cnt++;
    puts((cnt & 1) ? "Koyomi" : "Karen");
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
	cout<<"Karen"<<endl;
	return 0;
 }

#include<bits/stdc++.h>
using namespace std;
#define pc(x) putchar(x)
namespace ib {char b[100];}
inline void pi(int x){
	if(x==0) {pc(48); return;}
	if(x<0) {pc('-'); x=-x;}
	char *s=ib::b;
	while(x) *(++s)=x%10,x/=10;
	while(s!=ib::b) pc((*(s--))+48);
}
inline void ri(int &x){
	x=0; static char c; bool t(0);
	while(c=getchar(),c<'0'||c>'9') if(c=='-') t=1; else t=0;
	do x=(x<<1)+(x<<3)+c-'0'; while(c=getchar(),c>='0'&&c<='9');
	if(t) x=-x;
}
const int N=10000024;
bool vis[N]; int a[N],b[N];
int main(){
	//freopen("0.in","r",stdin);
	int i,j,n,gs=0; ri(n);
	for(i=1;i<=n;++i) ri(a[i]),vis[a[i]]=1;
	for(i=1;i<=n;++i) ri(b[i]),vis[b[i]]=1;
	for(i=1;i<=n;++i)
	for(j=1;j<=n;++j) if(vis[a[i]^b[j]]) ++gs;
	if(gs&1) puts("Koyomi"); else puts("Karen");
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

ll ara1[2500];
ll ara2[2500];
vector<ll>v;

int main()
{
    int n;
    scanf("%d",&n);

    for(int  i=0;i<n;i++){
        scanf("%lld",&ara1[i]);
        v.push_back(ara1[i]);
    }
    for(int i=0;i<n;i++){
        scanf("%lld",&ara2[i]);
        v.push_back(ara2[i]);
    }
    sort(v.begin(),v.end());

    int cnt=0;
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(binary_search(v.begin(),v.end(),ara1[i]^ara2[j])){
              cnt+=1;
            }
        }
    }
    puts(cnt%2==0?"Karen":"Koyomi");

    return 0;
}

#include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <stdio.h>
#include <conio.h>
using namespace std;

int main()
{
	int a[2001], b[2001];
	int n,i,j,k1=0;
	cin>>n;
	for(i=0; i<n; i++)
	{cin>>a[i]; }

		for(i=0; i<n; i++)
	{cin>>b[i];}

 for (i=0; i<2*n; i++) {
for (j=0; j <2*n; j++) {
if (j!= i) k1++;
 } }
	    if (k1%2==0) cout<<"Karen"; else cout<<"Kayomi";
	}

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
// A recursive binary search function. It returns location of x in
// given array arr[l..r] is present, otherwise -1
int binarySearch(int arr[], int l, int r, int x)
{
   if (r >= l)
   {
        int mid = l + (r - l)/2;

        // If the element is present at the middle itself
        if (arr[mid] == x)  return mid;

        // If element is smaller than mid, then it can only be present
        // in left subarray
        if (arr[mid] > x) return binarySearch(arr, l, mid-1, x);

        // Else the element can only be present in right subarray
        return binarySearch(arr, mid+1, r, x);
   }

   // We reach here when element is not present in array
   return -1;
}
int main()
{
    int n,np=0;
    cin >> n;
    int a[n+1],b[n+1];
    for(int i=1;i<n+1;i++)
        cin >> a[i];
    for(int i=1;i<n+1;i++)
        cin >> b[i];
    sort(a+1,a+n+1);
    sort(b+1,b+n+1);
    for(int i=1;i<n+1;i++)
    {
        for(int j=1;j<n+1;j++)
        {
          int r= a[i] xor b[j];
          if(binarySearch(a,1,n+1,r) > 0 || binarySearch(b,1,n+1,r) > 0)
                np++;
        }
    }
    if(np%2 == 0)
        cout <<  "Karen" << endl;
    else
        cout <<  "Koyomi" << endl;

}

///HEADER FILES///

#include <cstdio>
#include <cstring>
#include <cmath>
#include <cctype>
#include <stack>
#include <queue>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cstdlib>
#include <complex>
#include <iomanip>
#include <utility>
#include <bitset>
#include <list>
#include <assert.h>
#include <numeric>
#include <fstream>
using namespace std;

///DEFINES///

///ALWAYS USEFUL
#define     caseprint(case)     printf("Case %d: ", case ++)
#define     caseprintnl(case)   printf("Case %d:\n", case ++)
#define     clr(a)              memset(a, 0, sizeof(a))
#define     mem(a, b)           memset(a, b, sizeof(a))
#define     pb                  push_back
#define     pp                  pop_back
#define     full(v)             v.begin(), v.end()
#define     sort_vec(v)         sort(full(v))
#define     sf                  scanf
#define     pf                  printf
#define     NL                  pf("\n")
#define     sz(a)               (int)a.size()
#define     bitcheck(n, pos)    (n & (1<<(pos)))
#define     biton(n, pos)       (n | (1<<(pos)))
#define     bitoff(n, pos)      (n & ~(1<<(pos)))
#define     sqr(a)              ((a)*(a))

///SCAN
#define     sfs(a)              scanf("%s", &a)
#define     sfi1(a)             scanf("%d", &a)
#define     sfi2(a, b)          scanf("%d %d", &a, &b)
#define     sfi3(a, b, c)       scanf("%d %d %d", &a, &b, &c)
#define     sfi4(a, b, c, d)    scanf("%d %d %d %d", &a, &b, &c, &d)
#define     sfd1(a)             scanf("%lf", &a)
#define     sfd2(a, b)          scanf("%lf %lf", &a, &b)
#define     sfd3(a, b, c)       scanf("%lf %lf %lf", &a, &b, &c)
#define     sfd4(a, b, c, d)    scanf("%lf %lf %lf %lf", &a, &b, &c, &d)
#define     sfll1(a)            scanf("%lld", &a)
#define     sfll2(a, b)         scanf("%lld %lld", &a, &b)
#define     sfll3(a, b, c)      scanf("%lld %lld %lld", &a, &b, &c)
#define     sfll4(a, b, c, d)   scanf("%lld %lld %lld %lld", &a, &b, &c, &d)
#define     sfull1(a)           scanf("%llu", &a)
#define     sfull2(a, b)        scanf("%llu %llu", &a, &b)
#define     sfull3(a, b, c)     scanf("%llu %llu %llu", &a, &b, &c)
#define     sfull4(a, b, c, d)  scanf("%llu %llu %llu %llu", &a, &b, &c, &d)

///GEOMETRY
#define     ang(a, b, c)            acos((sqr(b)+sqr(c)-sqr(a))/(2.0*b*c))
#define     dist(x1, y1, x2, y2)    sqrt(sqr(x1-x2)+sqr(y1-y2))

///TYPES///
typedef     long long ll;
typedef     unsigned long long ull;
typedef     pair<int, int>      pii;
typedef     pair<ll, ll>        pll;

struct debugger
{
    template<typename T> debugger& operator, (const T& v)
    {
        cerr<<v<<" ";
        return *this;
    }
} dbg;
#define deb(args ...){dbg, args; cerr<<endl;}

//ll extGcd(ll a, ll b, ll& x, ll& y){if (b == 0){x = 1;y = 0;return a;}else{int g = extGcd(b, a % b, y, x);y -= a / b * x;return g;}}
//ll modInv(ll a, ll m){ll x, y; extGcd(a, m, x, y); x %= m; while (x < 0){x += m;} return x;}
//ll BigMod(ll b, ll p, ll m) {if(!p) return 1; ll x=BigMod(b,p/2,m); x=(x*x)%m; if(p&1) x=(x*b)%m; return x;}
//ll bigmod(ll B,ll P,ll M){ ll R=1%M; while(P>0) {if(P%2==1){R=(R*B)%M;}P/=2;B=(B*B)%M;} ret urn R;} /// (B^P)%M

//int x[] = {0,0,-1,1};//4-ways
//int y[] = {1,-1,0,0};//4-ways
//int x[] = {-1,-1,-1,0,0,1,1,1};//8-ways
//int y[] = {-1,0,1,-1,1,-1,0,1};//8-ways
//int x[] = {-2,-2,2,2,1,1,-1,-1};//knight moves
//int y[] = {1,-1,1,-1,2,-2,2,-2};//knight moves

///CONSTANTS
#define     pi                  acos(-1.0)
#define     ex                  exp(1)

///OTHERS
#define     READ                freopen("input.txt","r",stdin);
#define     WRITE               freopen("out.txt","w",stdout);
#define     accelerate          ios_base::sync_with_stdio(false); cin.tie(NULL)
#define     debug               printf("Ok\n")
#define     MOD                 1000000007
#define     M                   500000

int main()
{
    int n;

    while(sfi1(n)==1)
    {
        int a[n+5], b[n+5];

        map<int, int>mp;

        for(int i=0; i<n; i++) sfi1(a[i]), mp[a[i]]=1;
        for(int i=0; i<n; i++) sfi1(b[i]), mp[b[i]]=1;

        int ans=0;

        for(int i=0; i<n; i++)
        {
            for(int j=0; j<n; j++)
            {
                int xx=a[i]^b[j];
                if(mp.find(xx)!=mp.end()) ans++;
            }
        }

        if(ans&1) pf("Koyomi\n");
        else pf("Karen\n");
    }
    return 0;
}

#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
bool isin[2000010];
int a[2010];
int b[2010];
int main()
{
	int n;
	scanf("%d",&n);
	memset(isin,0,sizeof(isin));
	memset(a,0,sizeof(a));
	memset(b,0,sizeof(b));
	for(int i=0;i<n;i++)
	{
		scanf("%d",&a[i]);
		if(a[i]<2000010)isin[a[i]]=1;
	}
	for(int i=0;i<n;i++)
	{
		scanf("%d",&b[i]);
		if(b[i]<2000010)isin[b[i]]=1;
	}
	int ans=0;
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<n;j++)
		{
			if((a[i]^b[j])>0&&(a[i]^b[j])<2000010&&isin[a[i]^b[j]])ans++;
		}
	}
	if(ans%2==0)
		printf("Karen\n");
	else
		printf("Koyomi\n");
}

#include<bits/stdc++.h>
using namespace std;
int c[4194304];
int main()
{
    int a[2006];
    int b[2006];
    int n;
    memset(b,0,sizeof b);
    cin>>n;
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
        c[a[i]]=1;
    }
    for(int i=0;i<n;i++)
    {
        cin>>b[i];
        c[b[i]]=1;
    }
    long long count=0;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            if(c[(a[i]^b[j])]==1)
                ++count;
        }
    }
    if(count%2==0)
        cout<<"Karen"<<endl;
    else
        cout<<"Koyomi"<<endl;
}

#include <bits/stdc++.h>
#define p_b push_back
#define endl "\n"
#define m_p make_pair
#define fi first
#define se second
#define pll pair <ll,ll>
using namespace std;
typedef int ll;
template <typename T>
T sqr(T x)
{
    return x*x;
}
const ll shl=1;
const ll maxn=1000000;
vector <ll> tt[1000];
set <ll> ss;
ll mp[10000000];
string s,s1;
char cc;
ll p[1000000],c,sc,n,m,i,j,a[1000000],b[1000000],a1,b1,c1,ans,x,k;
void vout(string s)
{
    cout << s << endl;
    exit(0);
}
int main() {

    // set < ll > :: iterator kek=s.begin;
    ios_base :: sync_with_stdio(0);
    cin.tie(0);
    //freopen("1.in","r",stdin);
    //freopen("1.out","w",stdout);
    cin >> n;
    for(i=0;i<n;i++)
    {
        cin >> a[i];
        mp[a[i]]=1;
    }
    for(i=0;i<n;i++)
    {
        cin >> b[i];
        mp[b[i]]=1;
    }
    for(i=0;i<n;i++)for(j=0;j<n;j++)if(mp[(a[i]^b[j])]==1)ans++;
    if(ans%2==0)vout("Karen");
    vout("Koyomi");
    return 0;
}

#include <iostream>
#include <algorithm>

#define MAX 2000
#define MAXN 2000000

using namespace std;

int n, max, sol, x[MAX], y[MAX], valid[MAXN+1];

int main()
{
  cin >> n;
  for(int i=0; i<2*n; ++i)
  {
    if(i<n)
      cin >> x[i], valid[x[i]] = 1;
    else
      cin >> y[i-n], valid[y[i-n]] = 1;
  }

  sol = 0;
  for(int i=0; i<n; ++i)
    for(int j=0; j<n; ++j)
    {
      int r = x[i]^y[j];
      if(r<=MAXN && valid[r])
        sol++;
    }

  //cout << sol << endl;
  cout << ( !(sol%2) ? "Karen" : "Koyomi") << endl;

  return 0;
}

#include <bits/stdc++.h>

using namespace std;
int mp[2010*2010];
int a[2010],b[2010];

int main()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        mp[ a[i] ]=1;
    }
    for(int i=1;i<=n;i++)
    {
        cin>>b[i];
        mp[ b[i] ]=1;
    }
    int cnt=0;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            if( mp[ a[i]^b[j] ] )
                cnt++;
        }
    }
    if(cnt&1) cout<<"Koyomi"<<endl;
            else cout<<"Karen"<<endl;
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
const int maxn = 2000000 + 10;
long long a[maxn],b[maxn];
int vis[maxn];
int main()
{
	int n;
	while(cin >> n){
		memset(vis,0,sizeof(vis));
		for(int i = 0;i < n;i++){
			cin >> a[i];
			vis[a[i]] = 1;
		}
		for(int i = 0;i < n;i++){
			cin >> b[i];
			vis[b[i]] = 1;
		}
		int num = 0;
		for(int i = 0;i < n;i++)
			for(int j = 0;j < n;j++){
				long long m = a[i] ^ b[j];
				if(vis[m] == 1) num++;
			}
		if(num % 2 == 0) printf("Karen\n");
		else printf("Koyomi\n");
	}
	return 0;
}

 #include<bits/stdc++.h>
#define ll long long int

using namespace std;

int main()
{
    int a[2000000],b[2000000];
    map<int,bool>m;
    std::map<int,bool>::iterator it;
    int n;
    int count=0;
    cin>>n;
    for(int j=0;j<n;j++)
    {
        cin>>a[j];
        m[a[j]]=true;
    }
    for(int j=0;j<n;j++)
    {
        cin>>b[j];
        m[b[j]]=true;
    }
    for(int j=0;j<n;j++)
    {
        for(int k=0;k<n;k++)
        {
            int l;
            l=a[j]^b[k];
            it = m.find(l);
            if (it != m.end())
            {
                count++;
            }
        }
    }
    if(count%2==0)
    {
        cout<<"Karen";

    }
    else
    {
        cout<<"Koyomi";
    }
  return 0;
}

#include<bits/stdc++.h>
using namespace std;

int C[4000000]={0};
int main()
{
	int n;
	cin >> n;
	int even = 0;
	int A[4000]={0};
	int B[4000]={0};
	for(int i=0;i<n;i++)
	{
		int a;
		cin >> a;
		A[i]=a;
		C[a]++;
	}

	for(int j=0;j<n;j++)
	{
		int a;
		cin >> a;
		B[j]=a;
		C[a]++;
	}

	for(int i=0;i<n;i++)
	{
		for(int j=0;j<n;j++)
		{
			int d = (A[i]^B[j]);
			if(C[d]==1 && A[i]>0 && B[j]>0)
			{
				even++;
			}
		}
	}

	if(even%2 == 0)
	{
		cout << "Karen";
	}
	if(even%2==1)
	{
		cout << "Koyomi";
	}

	return 0;
}

///*sutirtha rej*///
#include<bits/stdc++.h>
using namespace std;

bool h[2097152+100];
int main()
{
            int n;
            cin>>n;
            int a[n],b[n],c;
            c=0;
            for(int i=1;i<=n;i++)
            cin>>a[i],h[a[i]]=1;
            for(int i=1;i<=n;i++)
            cin>>b[i],h[b[i]]=1;
            for(int i=1;i<=n;i++)
            {
				for(int j=1;j<=n;j++)
				{
					 if(h[a[i]^b[j]])
					 c++;
				 }
			 }
			 if(c%2==0)
			 cout<<"Karen"<<endl;
			 else cout<<"Koyomi"<<endl;
			 return 0;
}

#include <iostream>
#include <vector>
#include <string>
#include <string.h>
#include <stack>
#include <algorithm>
#include <climits>
#include <iomanip>
#include <map>
#include <numeric>
#include <sstream>
#include <math.h>
#include <list>
#define PI 3.14159265
using namespace std;

int main () {
    cin.tie(0);
    cin.sync_with_stdio(0);
    int n;
    cin>>n;
    vector<int>arr1(n);
    vector<int>arr2(n);
    map<int ,bool>vis;
    for (int i = 0; i < n; ++i){
        cin>>arr1[i];
        vis[arr1[i]]=1;
    }
    for (int i = 0; i < n; ++i){
        cin>>arr2[i];
        vis[arr2[i]]=1;
    }
    int cnt=0;
    for (int i = 0; i < n; ++i){
        for (int j = 0; j < n ; ++j){
            if(vis[i^j]==1)
                cnt++;
        }
    }
    if(cnt%2==0)
        cout<<"Karen";
    else
        cout<<"Koyomi";

}

#include<bits/stdc++.h>
#define ll long long int

using namespace std;

int main()
{
    int a[2000000],b[2000000];
    unordered_map<int,bool>m;
    int n;
    int count=0;
    cin>>n;
    for(int j=0;j<n;j++)
    {
        cin>>a[j];
        m[a[j]]=true;
    }
    for(int j=0;j<n;j++)
    {
        cin>>b[j];
        m[b[j]]=true;
    }
    for(int j=0;j<n;j++)
    {
        for(int k=0;k<n;k++)
        {
            int l;
            l=a[j]^b[k];
            if(m[l]==true)
            {
                count++;
            }
        }
    }
    if(count%2==0)
    {
        cout<<"Karen";

    }
    else
    {
        cout<<"Koyomi";
    }
  return 0;
}

#include <iostream>

//I'm coming for you.    ...Winter

using namespace std;

#define N 3000003

int n;

long long stark[N];

int mepisSityva;

int main(){

	cin>>n;

	long long a[n],b[n];

	for(int i=0;i<n;i++)
		cin>>a[i],
		stark[a[i]]=1;

	for(int i=0;i<n;i++)
		cin>>b[i],
		stark[b[i]]=1;

	for(int i=0;i<n;i++)
		for(int j=0;j<n;j++)
			if(stark[a[i] xor b[j]]==1)
				mepisSityva++;

	if(mepisSityva%2==0)
		cout<<"Karen";
	else
		cout<<"Koyomi";

}

#include <cstdio>

int main()
{
    printf("Karen\n");
}

#include <iostream>

using namespace std;

int main()
{
    int n, x;

    cin >> n;

    for (int i = 1; i <= n; i++)
        cin >> x;

    for (int i = 1; i <= n; i++)
        cin >> x;

    cout << "Karen";

    return 0;
}

//Sagar Kaushal
#include<bits/stdc++.h>
using namespace std;
#define fwd(i,a,b) for(i=a;i<b;i++)
#define rev(i,a,b) for(i=a;i>b;i--)
#define ll long long
#define vll vector< long long >
#define vi vector<int>
#define pb push_back
#define pii pair<int,int>
#define pll pair< ll , ll >
#define vpll vector< pll >
#define sp(x) x.F>>x.S
#define F first
#define S second
#define dbl long double
#define str string
#define pdbl pair<dbl,dbl>
#define PI 3.14159265358979323846
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define sd(t) scanf("%d",&t)
#define pd(t) printf("%d\n",t)
#define slld(t) scanf("%lld",&t)
#define plld(t) printf("%lld\n",t)
#define MOD 1000000007
#define EPS 1e-9
#define gc getchar_unlocked
#define pc putchar_unlocked
vll mp(2000001,0);
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	ll n,m,f,i,x,z,y,j,k,l,t;
	str b;
	cin>>n;
	vll v1(n),v2(n);
	fwd(i,0,n)
	{
		cin>>v1[i];
		mp[v1[i]]=1;
	}
	fwd(i,0,n)
	{
		cin>>v2[i];
		mp[v2[i]]=1;
	}
	ll c=0;
	fwd(i,0,n)
	{
		fwd(j,0,n)
		{
			l=v1[i]^v2[j];
			if(l>2e6)
				continue;
			if(mp[l]==1)
			{
				c++;
			}
		}
	}
	if(c%2==1)
	{
		cout<<"Koyomi";
	}
	else
		cout<<"Karen";
	return 0;
}

#include<bits/stdc++.h>
int main()
{
	printf("Karen\n");
}

#include <iostream>
using namespace std;
int main()
{
    cout<<"Karen";
    return 0;
}

#include <iostream>
#include <math.h>
#include <vector>
#include <algorithm>

using namespace std;

const int maxv = 4e6 + 10;
int nums[maxv];

vector<int> a = vector<int>();
vector<int> b = vector<int>();

int main() {
    cin.sync_with_stdio(false);
    cin.tie(0);

    int n;

    cin >> n;

    for (int i = 0; i < n; i++) {
        int temp;
        cin >> temp;
        a.push_back(temp);
        nums[temp] = 1;
        if (temp > 2000000)
            cout << temp << endl;
    }

    for (int i = 0; i < n; i++) {
        int temp = 0;
        cin >> temp;
        b.push_back(temp);
        nums[temp] = 1;
        if (temp > 2000000)
            cout << temp << endl;
    }

    int re = 0;
    for (int i = 0; i < n; i++) {
        for (int j =0 ;j < b.size(); j++) {
            if (nums[a[i] ^ b[j]] == 1) {
                re++;
            }
        }
    }

    if (re % 2== 0)
        cout << "Karen" << endl;
    else
        cout << "Koyomi" << endl;

    return 0;
}

#include <cstdio>
int main(){
	//How interesting it is!
    printf("Karen\n");
	return 0;
}

#include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <stdio.h>
using namespace std;

int main()
{

	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	int x,n,k,a[2001], b[2001];
	k = 0;
	cin >> n;

	for (int i = 0; i < (2 * n); i++) {
		cin >> x;
		a[i] = x;
	}

	for (int i = 0; i < (2 * n); i++) {
		for (int j = 0; j < (2 * n); j++) {
			if (j != i) {
				k++;
		//		cout << (a[i] ^ a[j]) << " ";
			}
		}
	}

	if (k % 2 == 0) { cout << "Karen"; }
	else { cout << "Koyomi"; }

}

#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
using namespace std;
const int maxn = 4000006;

int main() {

        puts("Karen");

    return 0;
}

                                    /* In the name of Allah */
#include<bits/stdc++.h>
using namespace std;
void MAZEN(){ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);}
int main()
{
    MAZEN();
    int n, counter = 0;
    cin >> n;
    vector<int>v(n), v2(n);
    unordered_map<int, int>m;
    for (int i = 0; i < n; i++)
        cin >> v[i], m[v[i]]++;
    for (int i = 0; i < n; i++)
        cin >> v2[i], m[v2[i]]++;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            if (m[v[i] ^ v2[j]] != 0)
                counter++;
        }
    }
    cout << (counter % 2 == 0 ? "Karen" : "Koyomi") << endl;
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
bool ok[100000000];
int main()
{
    long long a,b,c,d,e,i,j,k;
    cin>>a;
    set<long long>st;
    vector<long long>s,v,t;
    for(i=0;i<a;i++){
        cin>>b;
         ok[b]=true;
        t.push_back(b);
    }
    for(j=0;j<a;j++){
        cin>>c;
       ok[c]=true;
        s.push_back(c);
    }

    long long count=0;
    for(i=0;i<a;i++){
            for(j=0;j<v.size();j++){
         if(ok[(s[i]) ^ (t[j])]){
            count++;

        }
    }
    }
    if(count%2==0)
        cout<<"Karen"<<endl;
    else cout<<"Koyomi"<<endl;
    return 0;
}

#include<iostream>
using namespace std;
#define maxn 4000007
bool vis[maxn] = {false};

int main()
{
    int k1[4007], k2[4007];
    int n;

    cin>>n;

    for(int i=0; i<n; i++)
    {
       cin>>k1[i];
       vis[k1[i]];
    }

    for(int j=0; j<n; j++)
    {
        cin>>k2[j];
        vis[k2[j]];
    }

    int ans = 0;

    for(int i=0; i<n; i++)
        for (int j=0; j<n; j++)
            if(vis[k1[i]^k2[j]])
                ++ans;

    if(ans%2 == 0)
        cout<<"Karen";
    else
        cout<<"Koyomi";

    return 0;
}

#include <iostream>
#include <stdio.h>
#include <string.h>

inline int nxt(){
     int n;
     scanf("%d", &n);
     return n;
 }
int main(){
    int n = nxt();
    int a[n], b[n];
    bool c[3000000];
    memset(c,false,sizeof(c));
    for(int i = 0; i < n; ++i){
        a[i] = nxt();
        c[a[i]] = true;
    }
    for(int i = 0; i < n; ++i){
        b[i] = nxt();
        c[b[i]] = true;
    }
    int count = 0;
    for(int i = 0; i < n; ++i){
        for(int j = 0; j < n; ++j){
            if(c[a[i]^b[j]]) count++;
        }
    }
    if(count%2)printf("Koyomi\n");else printf("Karen\n");
}

#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define pi pair<int,int>
#define pl pair<long long,long long>
#define lg length()
#define pb push_back
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005

int n,x[2005],y[2005];

struct treap{
    int v,k,cnt,h,l,r,p;
};

vector <treap> t;

void Init(){
    t.push_back({1000000007,0,0,0,-1,-1,-1});
    srand(time(NULL));
}

void RotL(int nod){
    int p=t[nod].p,k=t[nod].l,d=t[k].r;
    if(t[p].l==nod)
        t[p].l=k;
    else
        t[p].r=k;
    t[k].p=p;
    t[nod].p=k;
    t[k].r=nod;
    t[nod].l=d;
    if(d!=-1) t[d].p=nod;
    if(t[k].l!=-1) t[nod].h-=t[t[k].l].h;
    t[nod].h--;
    if(t[nod].r!=-1) t[k].h+=t[t[nod].r].h;
    t[k].h++;
}

void RotR(int nod){
    int p=t[nod].p,k=t[nod].r,d=t[k].l;
    if(t[p].l==nod)
        t[p].l=k;
    else
        t[p].r=k;
    t[k].p=p;
    t[nod].p=k;
    t[k].l=nod;
    t[nod].r=d;
    if(d!=-1) t[d].p=nod;
    if(t[k].r!=-1) t[nod].h-=t[t[k].r].h;
    t[nod].h--;
    if(t[nod].l!=-1) t[k].h+=t[t[nod].l].h;
    t[k].h++;
}

void Balance(int nod){
    if(t[nod].l!=-1 && t[t[nod].l].k<t[nod].k) RotL(nod);
    else if(t[nod].r!=-1 && t[t[nod].r].k<t[nod].k) RotR(nod);
}

void Insert(int nod, int v, int k){
    t[nod].h++;
    if(v==t[nod].v){
        t[nod].cnt++;
        return;
    }
    if(v<t[nod].v){
        if(t[nod].l==-1){
            t.push_back({v,k,1,1,-1,-1,nod});
            t[nod].l=t.size()-1;
        }
        else Insert(t[nod].l,v,k);
    }
    if(v>t[nod].v){
        if(t[nod].r==-1){
            t.push_back({v,k,1,1,-1,-1,nod});
            t[nod].r=t.size()-1;
        }
        else Insert(t[nod].r,v,k);
    }
    Balance(nod);
}

bool Erase(int nod, int v){
    if(v==t[nod].v){
        if(t[nod].cnt>1){
            t[nod].cnt--;
            t[nod].h--;
            return 1;
        }
        if(t[nod].l==-1 && t[nod].r==-1){
            if(t[t[nod].p].l==nod) t[t[nod].p].l=-1;
            else t[t[nod].p].r=-1;
            return 1;
        }
        if(t[nod].l==-1) RotR(nod);
        else if(t[nod].r==-1) RotL(nod);
        else if(t[t[nod].l].k<t[t[nod].r].k) RotL(nod);
        else RotR(nod);
        t[t[nod].p].h--;
        return Erase(nod,v);
    }
    else{
        if(v>t[nod].v){
            if(t[nod].r!=-1){
                bool ret=Erase(t[nod].r,v);
                if(ret) t[nod].h--;
                return ret;
            }
            else return 0;
        }
        else{
            if(t[nod].l!=-0){
                bool ret=Erase(t[nod].l,v);
                if(ret) t[nod].h--;
                return ret;
            }
            else return 0;
        }
    }
}

bool Find(int nod, int v){
    if(t[nod].v==v) return 1;
    if(v>t[nod].v){
        if(t[nod].r==-1) return 0;
        else return Find(t[nod].r,v);
    }
    else{
        if(t[nod].l==-1) return 0;
        else return Find(t[nod].l,v);
    }
}

int Kth(int nod, int k){
    int x=0;
    if(t[nod].l!=-1) x=t[t[nod].l].h;
    if(x+1<=k && x+t[nod].cnt>=k) return t[nod].v;
    else{
        if(x+1>k) return Kth(t[nod].l,k);
        else if(t[nod].r!=-1) return Kth(t[nod].r,k-x-t[nod].cnt);
        else return -1;
    }
}

void QryI(int v){
    int p=rand()*1000+rand()+1;
    Insert(0,v,p);
}

void QryE(int v){
    if(Erase(0,v)) t[0].h--;
}

bool QryF(int v){
    return Find(0,v);
}

int QryK(int v){
    return Kth(1,v);
}

int q;

int32_t main(){
    ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
    Init();
    cin >> n;
    for(int i=1;i<=n;i++) cin >> x[i],QryI(x[i]);
    for(int i=1;i<=n;i++) cin >> y[i],QryI(y[i]);
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(QryF(x[i]^y[j])) q++;
        }
    }
    if(q%2) cout << "Koyomi";
    else cout << "Karen";
}

/*
	---------O7Oo7oO7O-------------
*/

#include <bits/stdc++.h>

#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
using namespace std;
#define all(v) v.begin(),v.end()

int Bin_expo(int n, int b, int m)
{
	int res = 1;
	while (b > 0)
	{
		if (b & 1)
		{
			res = (res * n) % m;

		}
		n = (n * n) % m;

		b /= 2;

	}
	return res % m;
}

int32_t main()
{
	IOS
#ifndef ONLINE_JUDGE
	freopen("inputf.txt", "r", stdin);
	freopen("output-ans.txt", "w", stdout);
#endif

	int n;
	cin>>n;
	vector<int> a(n),b(n);
	vector<int> mp(2*1000005,0);
	for(int i=0;i<n;i++)
	{
		cin>>a[i];
		mp[a[i]] =1;
	}
	for(int i=0;i<n;i++)
	{
		cin>>b[i];
		mp[b[i]]  = 1;
	}
	int cnt = 0;
	for(int i=0;i<n;i++)
	{
		for(int j = 0;j<n;j++ )
		{
			if((a[i]^b[j]) > 2*1e6)
				continue;
			if(mp[(a[i]^b[j])])
				cnt++;
		}
	}

	if(cnt&1)
		cout<<"Koyomi\n";
	else
		cout<<"Karen\n";

	return 0;

}

#include <iostream>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <vector>
#include <string>
#include <stack>
#include <array>
#include <stdint.h>
//#include "../incl/stuff.h"
#define MAXN 100000

using namespace std ;

int main ( void ) {

	int n ; cin >> n ;

	vector<int> vals( 2*n , 0 ) ;
	unordered_map<int,int> visited ;
	int result = 0 ;

	for ( int i = 0 ; i < 2*n ; i++ ) {
		cin >> vals[i] ;
		visited[vals[i]]++ ;
	}

	// O(N^2)
	for ( int i = 0 ; i < n ; i++ ) {
		for ( int k = 0 ; k < n ; k++ ) {
			result+= visited[ vals[i] ^ vals[k+n]] ;

		}
	}

	if ( result%2 ) {
		cout << "Koyomi" << endl ;
	}
	else{
		cout << "Karen" << endl;
	}

	return 0 ;
}

#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
   int t;t=1;
   while(t--)
   {
       unordered_map<int,int>m;
       int flag=0;
       int n;cin>>n;
       int A[n],B[n];

       for(int i=0;i<n;i++)
       {
           cin>>A[i];
           m[A[i]]++;
       }
       for(int i=0;i<n;i++)
       {
           cin>>B[i];
           m[B[i]]++;
       }
       int count=0;
       for(int i=0;i<n;i++)
       {
           for(int j=0;j<n;j++)
           {
               int k=A[i]^B[j];
               //cout<<A[i]<<" "<<B[j]<<" " <<k<<endl;
               if(m.count(k))
               {
                   count++;
               }
           }

       }
       //cout<<count<<endl;
       if(count%2==0)
       cout<<"Karen"<<endl;
       else
       cout<<"Koyomi"<<endl;
   }
}

#include <bits/stdc++.h>
#include <vector>

using namespace std;

typedef long long int ll ;

#define FOR(i,a,n) for(int i = a ; i < n ; i++)

int main() {
    ll n ,c =0 ; cin >> n ;

    ll kar[n] , kom[n] ;
    int val[4000002] = {0};

    FOR(i,0,n)
    {
        cin >> kar[i] ;
        val[kar[i]] = 1;
    }
    FOR(i,0,n)
    {
        cin >> kom[i] ;
        val[kom[i]] = 1;
    }

    FOR(i,0,n)
    {
        FOR(j,0,n)
        {
            if(val[kar[i]^kom[j]] == 1) c++ ;
        }
    }

    if(c%2 == 0)
        cout << "Karen" ;
    else
        cout << "Koyomi" ;

    return 0 ;
}

#include<bits/stdc++.h>
#define M 4040
using namespace std;
const int N = 5 * 1e6;
int a[M], b[M];
int vis[N];

int main(){
	int n;
	while(~scanf("%d",&n)){
		memset(vis, 0, sizeof(vis));
		for(int i = 0; i < n; i++){
			scanf("%d",&a[i]);
			vis[a[i]] = 1;
		}
		for(int i = 0; i < n; i++){
			scanf("%d",&b[i]);
			vis[b[i]] = 1;
		}
		int cnt = 0;
		for(int i = 0; i < n; i++){
			for(int j = 0; j < n; j++){
				if(vis[a[i]^b[j]] == 1){
					cnt++;
				}
			}
		}
		if(cnt & 1){
			printf("Koyomi\n");
		}else{
			printf("Karen\n");
		}
	}
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define ll  long long
#define inf 999999999999999999
#define fr(a,n) for(ll i=a;i<=n;i++)
#define sc2(x,y) scanf("%lld%lld",&x,&y);
#define sc1(x)  scanf("%lld",&x);
#define prll2(x,Y) prllf("%lld %lld",x,y);
#define prll1(x) prllf("%lld",x);
#define fd(i,a,b)   for(long long i=b;i>=a;i--)
#define clr(x)      memset(x,0,sizeof(x))
#define cln(x)      memset(x,-1,sizeof(x))
#define __          prllf(" ")
#define _           prllf("\n")
#define read()      freopen("in.txt","r",stdin)
#define write()     freopen("out.txt","w",stdout)
bool arr[20000010];
ll arr1[2010],arr2[2010];
int main()
{
    ll n;

    while(cin>>n)
    {

        for(ll i=0;i<=2000005;i++)
            arr[i]=false;
        ll arr1[2100],arr2[2100];

        for(ll i=0;i<n;i++){
            scanf("%d",&arr1[i]);
            arr[arr1[i]]=true;

        }
        for(ll i=0;i<n;i++){
            scanf("%d",&arr2[i]);
            arr[arr2[i]]=true;

        }

        ll cnt=0;
        for(ll i=0;i<n;i++)
        {
            for(ll j=0;j<n;j++)
            {
                ll x=arr1[i]^arr2[j];

                if(arr[x]==true)
                    cnt++;
            }
        }
        //cout<<cnt<<endl;
        if(cnt%2==0)
            cout<<"Karen"<<endl;
        else
        cout<<"Koyomi"<<endl;
    }
}

#include <bits/stdc++.h>

using namespace std;

int main()
{
    unordered_map<int,bool>arr;

    int n;
    cin>>n;
    int a1[n],a2[n];

    for(int i=0; i<n; i++)
    {
        scanf("%d",&a1[i]);
        arr[a1[i]]=1;
    }
    for(int i=0; i<n; i++)
    {
        scanf("%d",&a2[i]);
        arr[a2[i]]=1;
    }
    int temp=0,coun=0;
    for(int i=0; i<n; i++)
    {
        for(int j=0; j<n; j++)
        {
            temp=a1[i]^a2[j];
            if(arr[temp]== true)
            {
                coun++;
            }
        }
    }
    if(coun%2== 0)
    {
        cout<<"Karen"<<endl;
    }
    else
        cout<<"Koyomi"<<endl;

    return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define ll  long long
#define inf 999999999999999999
#define fr(a,n) for(ll i=a;i<=n;i++)
#define sc2(x,y) scanf("%lld%lld",&x,&y);
#define sc1(x)  scanf("%lld",&x);
#define print2(x,Y) printf("%lld %lld",x,y);
#define print1(x) printf("%lld",x);
#define fd(i,a,b)   for(long long i=b;i>=a;i--)
#define clr(x)      memset(x,0,sizeof(x))
#define cln(x)      memset(x,-1,sizeof(x))
#define __          printf(" ")
#define _           printf("\n")
#define read()      freopen("in.txt","r",stdin)
#define write()     freopen("out.txt","w",stdout)

int main()
{
    int n;

    while(cin>>n)
    {
        int arr1[2100],arr2[2100];
        for(int i=0;i<n;i++){
            scanf("%d",&arr1[i]);

        }
        for(int i=0;i<n;i++){
            scanf("%d",&arr2[i]);

        }

            cout<<"Karen"<<endl;

    }
}

#include <bits/stdc++.h>

using namespace std;

int main()
{
    map<int,bool>arr;

    int n;
    cin>>n;
    int a1[n],a2[n];

    for(int i=0; i<n; i++)
    {
        scanf("%d",&a1[i]);
        arr[a1[i]]=1;
    }
    for(int i=0; i<n; i++)
    {
        scanf("%d",&a2[i]);
        arr[a2[i]]=1;
    }
    int temp=0,coun=0;
    for(int i=0; i<n; i++)
    {
        for(int j=0; j<n; j++)
        {
            temp=a1[i]^a2[j];
            if(arr.find(temp)!=arr.end())
            {
                coun++;
            }
        }
    }
    if(coun%2== 0)
    {
        cout<<"Karen"<<endl;
    }
    else
        cout<<"Koyomi"<<endl;

    return 0;
}

#include <cstdio>
int main()
{
    printf("Karen\n");
}

#define _CRT_SECURE_NO_WARNINGS

#include <vector>
#include <iostream>
#include <string>
#include <functional>
#include <set>
#include <map>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <ctime>
#include <queue>
#include <deque>
#include <math.h>
#include <cmath>
#include <stack>
#include <algorithm>
#include <list>
#include <array>
#include <valarray>
#include <unordered_map>
#include <cassert>
#include <random>

using namespace std;

#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define all(a) a.begin(), a.end()
#define ll long long
#define forn(i, n) for (long long i = 0; i < (long long)(n); ++i)

double eps = 1e-9;
const long long INF = 1e9;
const long long base = 1e9 + 7;
const double PI = 3.1415926535897932384626433832795;

default_random_engine gen;
uniform_real_distribution<double> distr(1.0, 100.0);

int main() {
#ifdef _DEBUG
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif

	int n;
	cin >> n;
	vector<int> a(n);
	vector<int> b(n);
	set<int> was;

	for (int i = 0; i < n; i++) {
		cin >> a[i];
		was.insert(a[i]);
	}
	for (int i = 0; i < n; i++) {
		cin >> b[i];
		was.insert(b[i]);
	}

	int cnt = 0;

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (was.count(a[i] ^ b[j])) {
				cnt++;
			}
			//was.insert(a[i] ^ b[j]);
		}
	}

	if (cnt % 2 == 0) {
		cout << "Karen" << endl;
	}
	else {
		cout << "Koyomi" << endl;
	}
}

/*
 * aesth
 * Konstantinos Alatzas
 */

#include <bits/stdc++.h>

using namespace std;

#define afor(i,j,k,l) for(int i=j; i<=k; i+=l)
#define rfor(i,j,k,l) for(int i=j; i>=k; i-=l)
#define rep(i,j) afor(i,0,j-1,1)
#define rrep(i,j) rfor(i,j,0,1)
#define all(cont) cont.begin(),cont.end()
#define sz(cont) (int)cont.size()
#define pb push_back
#define inf(T) numeric_limits<T>::max()
#define minf(T) numeric_limits<T>::min()

typedef long long int lli;

int n, xi[2001], yi[2001], cnt;
set<int> s;

int main()
{
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin>>n;
	afor(i,1,n,1) cin>>xi[i], s.insert(xi[i]);
	afor(i,1,n,1) cin>>yi[i], s.insert(yi[i]);
	afor(i,1,n,1) afor(j,1,n,1) if(s.find(xi[i]^yi[j])!=s.end()) cnt++;
	if(cnt%2==0) cout<<"Karen";
	else cout<<"Koyomi";
	return 0;
}

// Starting with the name of Allah

#include <bits/stdc++.h>
#define ll long long
#define nl endl
#define Nayon ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define gcd(a,b)         __gcd(a,b)
#define lcm(a,b)         (a/gcd(a,b))*b
#define v_sum(a)         accumulate(a.begin(),a.end(),0)
#define v_max(a)         *max_element(a.begin(),a.end())
#define v_min(a)         *min_element(a.begin(),a.end())
#define v_uni(a)         a.erase(unique(a.begin(),a.end()),a.end())
#define pi          	 3.14159265358979323846
#define bit(n)			  __builtin_popcount (n)
using namespace std;

ll const mod=1073741824;

ll m[5000005];
int main()
{
	Nayon;
	ll t,n,i,j,k=0,cnt=0,sum1=0,ccnt=0,x,y,z,x1,y1=0,z1,d,total=0;
	cin>>n;
	ll a[n+1],b[n+1];
	for(i=0;i<n;i++){
		cin>>a[i];
		m[a[i]]++;
	}
	for(i=0;i<n;i++){
		cin>>b[i];
		m[b[i]]++;
	}
	for(i=0;i<n;i++){
		for(j=0;j<n;j++){
			if(m[a[i]^b[j]]){
				cnt++;
			}
		}
	}
	if(cnt&1){
		cout<<"Koyomi"<<nl;
	}
	else{
		cout<<"Karen"<<nl;
	}
	return 0;
}

//Happy Coding............

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <deque>
#include <numeric>
#include <stack>
#include <set>
#include <list>
#include <map>
#include <iomanip>
#include <ctime>

#define vi vector<int>
#define vd vector<double>
#define vll vector<ll>
#define ll long long
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vb vector<bool>
#define vvi vector<vector<int> >
#define vvll vector<vector<ll> >
#define vvd vector<vector<double> >
#define vvpii vector<vector<pii> >
#define vvpll vector<vector<pll> >
#define vvpdd vector<vector<pdd> >
#define vpii vector<pii>
#define vpdd vector<pdd>
#define vpll vector<pll>

#define all(x) x.begin(),x.end()
#define itn int
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define fr(a,b) for(int i=a;i<b;i++)
#define pb(x) push_back(x)
#define mp(a,b) make_pair(a,b)
#define sz(x) x.size()
#define fo(i, n) for(int i = 0; i < n; ++i)
#define ro(i, n) for(int i = n - 1; i >= 0; --i)

const ll mod = 1e9 + 7;
const ll mod2 = 998244353;
const long double PI = 3.14159265358979323846;
using namespace std;
const int maxn = 1e5 + 7;
vector<vc>arr;
vvi len;
vvi otv;

int n, m;
bool cmp(int i, int j, char b)
{
    return i != -1 && j != -1 && i < n && j < m && arr[i][j] == b;
}

int main()
{
    //freopen("buffcraft.in", "r", stdin);
    //freopen("buffcraft.out", "w", stdout);
#ifdef _DEBUG
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    cout << "Karen";

}

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<cassert>
#include<set>
#include<time.h>
#include<queue>
#include<map>
#include<sstream>
#include <bits/stdc++.h>

using namespace std;

#define vi vector < int >
#define vll vector < ll >
#define pb push_back
#define ll long long int
#define llu unsigned long long
#define MOD 1000000007
#define F first
#define S second
#define INF 2000000000
#define dbg(x) { cout<< #x << ": " << (x) << endl; }
#define loop(i,a,b) for(int i = a; i<b;i++)
#define all(x) x.begin(),x.end()
#define MAX 1000007
#define mapsi map < string, int >
#define mapii map < int, int >

int p(pair < ll , ll >  a, pair < ll , ll > b){
    return ((a.F==b.F)?(a.S>b.S):(a.F<b.F));
}

int main(){
    ios_base::sync_with_stdio(0);

    	cout<<"Karen";

    return 0;

}

/*
I seek protection in ALLAH, from the accursed Satan
In the name of ALLAH, the Benificent, the Merciful

xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
x                 Author                  x
x          -------------------            x
x           S.M. Rashedul Islam           x
x             Dept.of CSE,IU              x
x                  Kushtia                x
xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
*/

#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define mxm 2e18
#define fr(i,a) for(i=0;i<a;i++)
#define fr1(i,n,m) for(i=n;i<=m;i++)
#define sf(a) scanf("%lld",&a)
#define sf2(a,b) scanf("%lld %lld",&a,&b)
#define sf3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define pf(a) printf("%lld\n",a)
#define pf2(a,b) printf("%lld %lld\n",a,b)
#define pf3(a,b,c) printf("%lld %lld %lld\n",a,b,c)
#define NL printf("\n")

using namespace std;

long long  check[2000010];

int main(int argc, char const *argv[])
{
	long long test;
	while(cin>>test)
	{
		vector<long long>s1;
		vector<long long>s2;
		long long a,c,cn=0,i,j;
		fr(i,test)
		{
			cin>>a;
			s1.push_back(a);
			check[a]=1;
		}
		fr(i,test)
		{
			cin>>a;
			s2.push_back(a);
			check[a]=1;
		}
		fr(i,test)
		{
			fr(j,test)
			{
			    //printf("dhuklam\n");
				c=s1[i]^s2[j];
				//cout<<c<<endl;
				if(c>2000010)continue;
				if(check[c]==1)
				{
				   cn++;
				   //check[c]=0;
				}
			}
		}
		//cout<<cn<<endl;
		if(cn%2!=0)
		{
			cout<<"Koyomi"<<endl;
		}
		else
		{
			cout<<"Karen"<<endl;
		}
	}
	return 0;
}

#include <bits/stdc++.h>
#define ill int long long
#define ld long double
#define pb push_back
#define fi first
#define se second
using namespace std;
ill n,i,j,x[2005],y[2005],ans,k;
bool d[4000005];
int main()
{
    ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
    cin>>n;
    for (i=1;i<=n;i++)
    {
        cin>>x[i];
        d[x[i]]=1;
    }
    for (i=1;i<=n;i++)
    {
        cin>>y[i];
        d[y[i]]=1;
    }

    for (i=1;i<=n;i++)
    {
        for (j=1;j<=n;j++)
        {
            ans+=d[x[i]^y[j]];
        }
    }
    if (ans%2==0){cout<<"Karen";}
    else {cout<<"Koyomi";}
}

#include <iostream>
#include <vector>

using namespace std;

int main()	{
	int n;
	cin >> n;
	int karenNum[n];
	int koyomiNum[n];
	bool inList[4000007]; //2**21 is maximum since 2*10^6 gives 21 bits
	for (int i = 0; i < n; ++i)	{
		cin >> karenNum[i];
		inList[karenNum[i]] = true;
	}
	for (int i = 0; i < n; ++i)	{
		cin >> koyomiNum[i];
		inList[koyomiNum[i]] = true;
	}
	int numSatisfied = 0;
	for (int i = 0; i < n; ++i)	{
		for (int j = 0; j < n; ++j)	{
			if (inList[karenNum[i]^koyomiNum[j]] == true)	{
				numSatisfied++;
			}
		}
	}
	if (numSatisfied % 2 == 0)	{
		cout << "Karen";
	} else	{
		cout << "Koyomi";
	}
	return 0;
}

#include <iostream>

using namespace std;

int main() {

    cout<<"Karen"<<endl;}

// In The Name Of God

//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

#include<bits/stdc++.h>

using namespace std;

#define F first
#define S second
#define endl "\n"

//#define pi 3.14159265358
#define mod 1000000007
#define LOG 17
#define INF 9223372036854775807
#define EPS 0.0000001
#define ten 1024
#define mint 2147483647

#define pb push_back
#define pf pop_front
#define ppb pop_back
#define ins insert
#define emb emplace_back

#define back bc
#define front fr

#define sz(x) (int)(x).size()
#define len(x) (int)(x).length()

#define bit(x) __builtin_popcount(x)
#define bclz(x) __builtin_clz(x) // count of leading zeros before 1
#define bctz(x) __builtin_ctz(x) // count of zeros from last one
#define bpar(x) __builtin_parity(x)

#define sqr(x) (int)(sqrt(x))
#define all(x) (x) + 1, (x) + n + 1
#define them(x) (x).begin(),(x).end()
#define abs(x) (((x) < 0)?-(x):(x))
#define tmid(tl,tr) ((tl+tr) >> 1)
#define md(l,r) (l+((r-l) >> 1))
#define allsum(n) n * 1ll * (n + 1) / 2
#define lcm(a,b) ((a) * (b) / gcd(a,b))

#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)

typedef long long ll;
typedef long double ld;

//const int N = (int);

void speedup() {
    ios_base::sync_with_stdio(NULL);
    cin.tie(0);
    cout.tie(0);
}

inline string tobin(ll x){
    char bin[2] = "";
    return _itoa(x, bin, 2);
}

inline ll gcd(ll a,ll b) {
    while(b) {
        a%=b;
        swap(a,b);
    }
    return a;
}
inline ll bpow(ll a,ll b) {
    ll rav1 = 1;
  while (b) {
    if(b & 1)
      rav1*=a;
    a*=a;
    b >>= 1;
  }
  return rav1;
}
inline ll fact(ll x) {
    if(x==0 || x==1 )return true;
    else return x*1ll*fact(x-1);
}

inline ll max(ll a, ll b){ return a>b ? a:b;}
inline ll min(ll a, ll b){ return a<b ? a:b;}

inline bool isnum(char n) {
    if(n>='0' && n<='9') {
        return true;
    }
    else {
        return false;
    }
}

inline bool lower(char c) {
    if((c >= 'a') && (c <= 'z')) {
        return true;
    }
    else {
        return false;
    }
}

inline bool upper(char c) {
    if((c >= 'A') && (c <= 'Z')) {
        return true;
    }
    else {
        return false;
    }
}

bool prime(ll n) {
    for(ll i = 2; i <= n; i++) {
        if(n % i == 0) {
            return false;
        }
        else {
            return true;
        }
    }
}

char all[] = {'a' , 'b' , 'c' , 'd' , 'e' ,'f' , 'g' , 'h' ,
 'i' , 'j' , 'k' , 'l' , 'm' , 'n' , 'o' , 'p' , 'q', 'r' ,
 's' , 't', 'u' , 'v' , 'w' , 'x' , 'y' , 'z'};

char key[] = {'q' , 'w' , 'e' , 'r' , 't' , 'y' , 'u' , 'i' ,
'o' , 'p' , 'a' , 's' , 'd' , 'f' , 'g' , 'h' , 'j' , 'k' ,
'l' , 'z' , 'x' , 'c' , 'v' , 'b' , 'n' , 'm'};

char big[] = {'A' , 'B' , 'C' , 'D' , 'E' , 'F' , 'G' , 'H' ,
'I' , 'J' , 'K' , 'L' , 'M' , 'N' , 'O' , 'P' , 'Q' , 'R' ,
'S' , 'T' , 'U' , 'V' , 'W' , 'X' , 'Y' , 'Z'};

void solve() {
    /// code is here
    cout << "Karen" << endl;
    return;
}

int main() {
    speedup();
    //file("name");
    int issa=1;
    while(issa--) {
        solve();
    }
    return 0;
}

#include <bits/stdc++.h>

using namespace std;
bool xy[2097130];

int main()
{
    int n, cpt=0;
    cin>> n;
    int xi[n], yi[n];
    for(int i=0;i<n;i++){
        cin>> xi[i];
        xy[xi[i]]=true;
    }
    for(int i=0;i<n;i++){
        cin>> yi[i];
        xy[yi[i]]=true;
    }
    for(int i=0;i<n;i++)
          for(int j=0;j<n;j++)
            if (xy[xi[i]^yi[j]])
            cpt++;
    if (cpt%2==0)
            cout<<"Karen"<<endl;
    else
        cout<<"Koyomi"<<endl;

    return 0;
}

#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
#include <stack>
#include <algorithm>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#define ll long  long
#define pb(x) push_back(x)
#define ull unsigned long long
#define sfl(a) scanf("%lld",&a)
#define sf(a) scanf("%d",&a)
#define pf(a) printf("%d\n",a)
#define pfl(a) printf("%lld\n",a)
#define loop(x,n) for(int x=1;x<=n;++x)
#define pi 3.14159265359
#define max 10000000
using namespace std;
bool temp[4000010];
int main()
{
	int a[2500],b[2500],n;
	sf(n);
	memset(temp,false,sizeof(temp));
	loop(i,n){
		sf(a[i]);
		temp[a[i]]=true;
	}
	for (int i=1;i<=n;i++)
	{
		sf(b[i]);
		temp[b[i]]=true;
	}
	int count=0;
	for (int i=1;i<=n;i++)
		for (int j=1;j<=n;j++)
			if (temp[a[i]^b[j]]) ++count;
	if (count%2==0) printf("Karen\n"); else printf("Koyomi\n");
	return 0;
}

#include <bits/stdc++.h>

using namespace std;
bool xy[2097152];

int main()
{
    int n, cpt=0;
    cin>> n;
    int xi[n], yi[n];
    for(int i=0;i<n;i++){
        cin>> xi[i];
        xy[xi[i]]=true;
    }
    for(int i=0;i<n;i++){
        cin>> yi[i];
        xy[yi[i]]=true;
    }
    for(int i=0;i<n;i++)
          for(int j=0;j<n;j++)
            if (xy[xi[i]^yi[j]])
            cpt++;
    if (cpt%2==0)
            cout<<"Karen"<<endl;
    else
        cout<<"Koyomi"<<endl;

    return 0;
}

#include <bits/stdc++.h>

using namespace std;
bool xy[4000000];

int main()
{
    int n, cpt=0;
    cin>> n;
    int xi[n], yi[n];
    for(int i=0;i<n;i++){
        cin>> xi[i];
        xy[xi[i]]=true;
    }
    for(int i=0;i<n;i++){
        cin>> yi[i];
        xy[yi[i]]=true;
    }
    for(int i=0;i<n;i++)
          for(int j=0;j<n;j++)
            if (xy[xi[i]^yi[j]])
            cpt++;
    if (cpt%2==0)
            cout<<"Karen"<<endl;
    else
        cout<<"Koyomi"<<endl;

    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    cout<<"Karen"<<endl;
    return 0;
}//123

#include <bits/stdc++.h>

using namespace std;
bool xy[2100000];

int main()
{
    int n, cpt=0;
    cin>> n;
    int xi[n], yi[n];
    for(int i=0;i<n;i++){
        cin>> xi[i];
        xy[xi[i]]=true;
    }
    for(int i=0;i<n;i++){
        cin>> yi[i];
        xy[yi[i]]=true;
    }
    for(int i=0;i<n;i++)
          for(int j=0;j<n;j++)
            if (xy[xi[i]^yi[j]])
            cpt++;
    if (cpt%2==0)
            cout<<"Karen"<<endl;
    else
        cout<<"Koyomi"<<endl;

    return 0;
}

#include <iostream>
#include <set>

using namespace std;

int main()
{
	int count, val, total = 0;
	bool isfound;
	cin >> count;

	set<int> st;

	int * x = new int[count];
	int * y = new int[count];

	for (int i = 0; i < count; i++)
	{
		cin >> x[i];
		st.insert(x[i]);
	}
	for (int i = 0; i < count; i++)
	{
		cin >> y[i];
		st.insert(y[i]);
	}

	for (int i = 0; i < count; i++)
	{
		for (int j = 0; j < count; j++)
		{
			val = x[i] ^ y[j];

			if (st.find(val) != st.end())
				total++;
		}
	}

	if (total & 0x01)
		cout << "Koyomi";
	else
		cout << "Karen";

	delete[] y;
	delete[] x;

	return 0;
}

#include<stdio.h>
int main(){ printf("Karen\n");}

#include<iostream>
#include<vector>
using namespace std;
int main(){
	int i,j,n,val,cnt=0;
	cin>>n;
	vector<bool> dp(4000040,false);
	vector<int> a;
	vector<int> b;
	for(i=0;i<n;i++){
		cin>>val;
		a.push_back(val);
		dp[val]=true;
	}
	for(i=0;i<n;i++){
		cin>>val;
		b.push_back(val);
		dp[val]=true;
	}
	for(i=0;i<n;i++){
		for(j=0;j<n;j++){
			val=a[i]^b[j];
			if(dp[val]){
				cnt++;
			}
		}
	}
	if(cnt%2){
		cout<<"Koyomi\n";
	}
	else{
		cout<<"Karen\n";
	}
	return 0;
}

//#include "pch.h"
#include<iostream>
#include<utility>
#include<iomanip>
#include<cmath>
#include<algorithm>
#include<cfloat>
#include<functional>
#include<string>
#include<numeric>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<chrono>
#include<cctype>
#include<iterator>
#include<bitset>
#include<fstream>
#include<sstream>
#include<locale>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define _CRT_SECURE_NO_DEPRECATE
#define read(FILE)  freopen(FILE, "r", stdin);
#define out(FILE) freopen(FILE, "w", stdout);
#define all(x) x.begin(),x.end()
#define enl '\n'
#define pb push_back
#define pff push_front
const int N = 1e5 + 5;
const ll mod9 = 1e9 + 9;
const ll mod7 = 1e9 + 7;
using namespace std;
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n, x[2000],y[2000],cnt = 0;
	vector<int>arr;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> x[i];
		arr.pb(x[i]);
	}
	for (int i = 0; i < n; i++)
	{
		cin >> y[i];
		arr.pb(y[i]);
	}
	sort(all(arr));

	ull ans = 0;
	for (int i = 0; i < n; i++)
	{
		ans = 0;
		for (int j = 0; j < n; j++)
		{
			ans = x[i] ^ y[j];
			if (binary_search(all(arr), ans)) {
				cnt++;

			}

		}

	}

	if (!(cnt & 1))
		cout << "Karen";
	else
		cout << "Koyomi";

}

#include <bits/stdc++.h>
using namespace std;
long n,res=0;
bool f[2097190]={0};
long a[2001],b[2001];
int main()
{
   // freopen("bai.inp","r",stdin);
   // freopen("bai.out","w",stdout);
   ios_base::sync_with_stdio(0);
    cin >> n ;
   // f.resize(2*n+1);
    for (long i=1;i<=n;i++)
        {cin >> a[i];f[a[i]]=1;}
    for (long i=1;i<=n;i++)
        {cin >> b[i];f[b[i]]=1;}
    for (long i=1;i<=n;i++)
        for (long j=1;j<=n;j++)
            if (f[a[i]^b[j]]==1)
            res++;
    if (res%2==0)
        cout << "Karen";
    else cout << "Koyomi";
    return 0;
}

#include <stdio.h>

int main()
{
    puts("Karen");
    return 0;
}

#include <bits/stdc++.h>

	#define ll          long long
	#define pb          push_back
	#define mp          make_pair
	#define pii         pair<int,int>
	#define vi          vector<int>
	#define all(a)      (a).begin(),(a).end()
	#define lol        1000000007
	#define endl        '\n'
	#define rep(i,a,b)	for(int i=a;i<b;i++)
	using namespace std;

	void MOD(ll &x)
	{
		if (x >= lol) x -= lol;
		if (x < 0) x += lol;
	}

	void solve()
	{
		int n;
		cin>>n;
		ll x[n], y[n];
		rep(i,0,n)
		{
			cin>>x[i];
		}
		rep(i,0,n)
		{
			cin>>y[i];
		}
		ll count = 0;
		rep(i,0,n)
		{
			ll c = x[i]^y[i];
			//cout<<c<<" ";
			rep(j,0,n)
			{
				if(c==x[j]||c==y[j])
				{
					count++;
					goto l;
				}
			}
			l:;
		}
		//cout<<count<<endl;
		if(count%2==0)
			cout<<"Karen"<<endl;
		else
			cout<<"kKoyomi"<<endl;

	}

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

#include <vector>
#include <iostream>
#include <algorithm>
#include <fstream>

using namespace std;

int main() {
	int num;
	cin >> num;

	vector<int> first (num);
	vector<int> second (num);
	for (int i = 0; i < num; i++) {
		cin >> first[i];
	}

	for (int i = 0; i < num; i++) {
		cin >> second[i];
	}

	int total = 0;
	for (int i = 0; i < num; i++) {
		for (int j = 0; j < num; j++) {
			int check = first[i] xor second[j];
			bool inFirst = false, inSecond = false;

			if (find(first.begin(), first.end(), first[i]) != first.end()) {
				inFirst = true;
			}

			if (find(second.begin(), second.end(), second[j]) != second.end()) {
				inSecond = true;
			}

			if ((inFirst) or (inSecond)) {
				total++;
			}
		}
	}

	if (total % 2 == 0) cout << "Karen" << endl;
	else cout << "Koyomi" << endl;
	return 0;
}

#include<iostream>
#include<cstdio>
using namespace std;
int a[2005],b[2005];
int main(){
    int n,t,cnt=0;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d",&a[i]);
    }
    for(int i=0;i<n;i++){
        scanf("%d",&b[i]);
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            t=a[i]^b[i];
            if(1<=t&&t<=2*n){
                cnt++;
            }
        }
    }
    cnt&1?printf("Koyomi"):printf("Karen");
    return 0;
}

#include <bits/stdc++.h>
using namespace std;

#define fo(i, n) for (i = 0; i < n; i++)
#define ll long long
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
#define ss(s) scanf("%s", s)
#define sd(n) scanf("%lf", &n)
#define sf(n) scanf("%f", &n)
#define pnl printf("\n")
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define fast ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define endl '\n'
#define end_routine() cout << "\n\nTime elapsed: " << (clock() - begtime) * 1000 / CLOCKS_PER_SEC << " ms\n\n";
int begtime = clock();
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;

void solve()
{
    int i, n, j;
    cin >> n;
    int a[n], b[n];
    fo(i, n) cin >> a[i];
    fo(i, n) cin >> b[i];
    int s = 0;
    fo(i, n)
    {
        fo(j, n)
        {
            int x = a[i] ^ b[j];
            if (x <= 2 * n)
            {
                s++;
            }
        }
    }
    //deb(s);
    cout << (s % 2 == 0 ? "Karen" : "Koyomi");
}

int main()
{
    fast;
    int t = 1;
    //cin >> t;
    while (t--)
    {
        solve();
    }
    //end_routine();
    return 0;
}

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
    int n;
    while(~scanf("%d",&n)){
            int x;
            for(int i=0;i<n*2;i++)
            scanf("%d",&x);
        if(n==2) printf("Koyomi\n");
        else printf("Karen\n");
    }
return 0;}

#define REP(i, n) for (long long i = 0; i < (n); i++)
#define RREP(i, a, b) for (long long i = a; i < (b); i++)
#define FOR(i, n) for (int i = n; i >= 0; i--)
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <cstring>
#include <vector>
#define ll long long
#define INF 1000000001;
using namespace std;
struct Edge{int from, to, cost;};

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n;
    cin >> n;
    ll x[2001];
    ll y[2001];
    REP(i, n){
        cin >> x[i];
    }
    REP(i, n){
        cin >> y[i];
    }

    int cnt = 0;

    set<ll> a;
    RREP(i, 1, 2*n+1){
        a.insert(i);
    }

    vector<ll> b;
    REP(i, n){
        REP(j, n){
            ll ans = x[i]^y[j];
            b.push_back(ans);
            //if(a.count(ans)) cnt++;
        }
    }

    for(auto num : b){
        if(a.count(num)) cnt++;
    }

    if(cnt % 2 == 0) cout << "Karen" << endl;
    else cout << "Koyomi" << endl;

    return 0;
}

#include <bits/stdc++.h>
using namespace std;
const int AX = 1e3+66;
int a[AX];
int b[AX];
map<int,int>mp;
int main(){
	int n;
	cin >> n;
	for( int i = 0 ; i < n ; i++ ){
		cin >> a[i];
		mp[a[i]] = 1;
	}
	for( int j = 0 ; j < n ; j++ ){
		cin >> b[j];
		mp[b[j]] = 1;
	}
	int ans = 0 ;
	for( int i = 0 ; i < n ; i++ ){
		 int tmp = ( a[i] ^ b[i] );
		 if( mp[tmp] ){
		 	ans ++ ;
		 }
	}
	if( ans % 2 == 0 ){
		cout << "Karen" << endl;
	}else{
		cout << "Koyomi" << endl;
	}
	return 0;
}

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string.h>
using namespace std;
int a[20005],b[20005];
int main()
{
	int n;
	cin>>n;
	for(int i=0;i<n;i++)cin>>a[i];
	for(int i=0;i<n;i++)cin>>b[i];
	int sum1=0,sum2=0;
	sort(a,a+n);sort(b,b+n);
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<n;j++)
		{
			int ans=a[i]^b[j];
			if(lower_bound(a,a+n,ans)!=upper_bound(a,a+n,ans))sum1++;
			if(lower_bound(b,b+n,ans)!=upper_bound(b,b+n,ans))sum2++;
		}
	}
	if(sum1>sum2)printf("Koyomi\n");
	else printf("Karen\n");
	return 0;
}

#include <iostream>
using namespace std;

int main() {
	// your code goes here
	int n;
	cin>>n;
	int a[n];
	int b[n];
	int hash[2000000]={0};
	for(int i=0;i<n;i++){
		cin>>a[i];
		hash[a[i]]++;
	}
	for(int i=0;i<n;i++){
		cin>>b[i];
		hash[b[i]]++;
	}int co=0;
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){int index=a[i]^b[j];
			//if(hash[a[i]^b[j]]>0) co++;
			if(index<=2000000 && index>=1) {
				if(hash[index]>0) co++;
			}
		}
	}
	if(co!=0 && co%2==0) cout<<"Karen"<<endl;
	else cout<<"Koyomi"<<endl;
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,count=0;
    cin>>n;
    long long int km[n],kr[n];
    for(int i=0;i<n;i++)
        cin>>km[i];
    for(int i=0;i<n;i++)
        cin>>kr[i];
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            int p=km[i]^kr[j];
            if(p==km[j] || p==kr[j])
            {
                count++;
            }
        }
    }
    if(count%2==0)
        cout<<"Karen";
    else
        cout<<"Koyomi";
    return 0;

}

//
//  main.cpp
//  Codeforces Round #439 (Div. 2) - A. The Artful Expedient
//
//  Created by S M HEMEL on 20/10/17.
//  Copyright © 2017 Eastern University. All rights reserved.
//

#include <iostream>
#include <map>
#define ll long long int
using namespace std;
ll a[2011];
ll b[2011];
map <ll,ll> C;
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n;
    cin >> n;
    for(int i=0; i<n; cin >> a[i],C[a[i]]=1,i++);
    for(int i=0; i<n; cin >> b[i],C[b[i]]=1,i++);
    int cnt = 0;
    for(int i=0; i<n; i++)
        if(C[a[i]^b[i]])
            cnt++;
    if(cnt&1)
        puts("Koyomi");
    else
        puts("Karen");
    return 0;
}

#include <iostream>

using namespace std;

const int MAXN = 2000 ;
const int MAXX = 2e6 ;

int main()
{

    int n;
    scanf("%d", &n);

    int doesExist[MAXX] ;
    int xx[MAXN], yy[MAXN];

    for(int i = 0; i < n; ++i) {
        scanf("%d", xx+i);
        doesExist[xx[i]] = 1;
    }

    for(int i = 0; i < n; ++i) {
        scanf("%d", yy+i);
        doesExist[yy[i]] = 1;
    }

    int cnt = 0;

    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < n; ++j) {
            int r = xx[i] ^ yy[j];
            if(0 <= r && r < MAXX && doesExist[r]==1)
                ++cnt;
        }
    }

    if (cnt % 2 == 0) {
       cout << "Karen";}
    else {
         cout << "Koyomi";
    }

    return 0;
}

#include <iostream>

using namespace std;

int rech(int a,int*tab,int n){
int i=0,test=0;
while((test=0)&&(i<n)){
    if(tab[i]==a)
        test=1;
    i++;}
    return(test);}
int main()
{
int n,i,j,nb=0,cmp1,cmp2;
cin>>n;
int x[n],y[n];
for(i=0;i<n;i++)
{
    cin>>x[i];
}
for(i=0;i<n;i++)
{
    cin>>y[i];
}
for(i=0;i<n;i++){
    for(j=0;j<n;j++){
        cmp1=rech((x[i]^y[j]),x,n);
        cmp2=rech((x[i]^y[j]),y,n);
        if(cmp1)
            nb++;
        if(cmp2)
            nb++;

            }
    }
    if(nb%2)
        cout<<"Koyomi";
    else
        cout<<"karen";

    return 0;
}

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll v[10000020]={0};
int main()
{
    ll n;
    cin>>n;
    ll a[n],b[n];
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
        v[a[i]]=1;
    }
    for(int i=0;i<n;i++)
    {
        cin>>b[i];
        v[b[i]]=1;
    }
    ll c=0;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            if(v[a[i]^b[i]])
            c++;
        }
    }
    if(c&1)
    cout<<"Koyomi"<<endl;
    else
    cout<<"Karen"<<endl;
}

#include<bits/stdc++.h>
using namespace std;
#define ll long long
 ll c[10000000]={0};
int main()
{
    int n,a[2001],b[2001],cnt=0;

    cin>>n;
    for(int i=0;i<n;i++){
        cin>>a[i];
        c[a[i]]=1;}
      for(int i=0;i<n;i++){
        cin>>b[i];
        c[b[i]]=1;}

    for(int i=0;i<n;i++)
      for(int j=0;j<n;j++)
      {
          if(c[a[i]^b[i]])
            cnt++;
      }

      if(cnt%2==0)
        cout<<"Karen"<<endl;
      else
        cout<<"Koyomi"<<endl;
}

#include <bits/stdc++.h>

using namespace std;

int main( void )
{
    long int n, count = 0;

    cin >> n;

    long int x[n * 2];

    for(int i = 1; i <= (n * 2); i++ )
    {
        cin >> x[i];
    }

    sort( x + 1, x + n + 1);
    sort( x + n + 2, x + n + n + 1);

    for(int i = 1; i <= n; i++ )
    {
        for(int j = n + 1; j <= n * 2; j++ )
        {
            long int y = ( x[i] ^ x[j] );
            int p = binary_search( x + 1, x + 1 + n, y);
            int q = binary_search( x + n + 2, x + 1 + n + n, y);
            if(  p == 1 | q == 1 )
            {
                count++;
                cout << count << endl;
            }
        }
    }

    if( count % 2 == 0)
    {
        cout << "Karen\n";
    }
    else
    {
        cout << "Koyomi\n";
    }

    return 0;
}

#include <iostream>
#include <vector>
#include <set>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> x(n);
    vector<int> y(n);
    set<int> a;
    for (int i = 0; i < n; i++){
        cin >> x[i];
        a.insert(x[i]);
    }
    for (int j = 0; j < n; j++){
        cin >> y[j];
        a.insert(y[j]);
    }
    int cur;
    int ans = 0;
    for (int i = 0; i < n; i++){
        for (int j = i; j < n; j++){
            cur = x[i] ^ y[j];
            if (a.find(cur) != a.end()){
                ans++;
            }
        }
    }
    if (ans % 2 == 0){
        cout << "Karen" << endl;
    }else{
        cout << "Koyomi" << endl;
    }
    return 0;
}

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int main()
{
    int n,i,cnt=0;
    cin>>n;
    ll no,a[2001],b[2001];
    map<ll,bool> mp;
    memset(a,0,sizeof(a));
    memset(b,0,sizeof(b));

    for(i=1;i<=n;i++)
    {
        cin>>no;
        mp[no]=true;
        a[i]=no;
    }

    for(i=1;i<=n;i++)
    {
        cin>>no;
        mp[no]=true;
        b[i]=no;
    }

    for(i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            //cout<<a[i]<<"  "<<b[j]<<endl;
            no = a[i]^b[i];
            if(mp.find(no)!=mp.end())
            {
                cnt++;
            }
        }
    }

    if(cnt%2==0)
    {
        cout<<"Karen"<<endl;
    }
    else
        cout<<"Koyomi"<<endl;

    return 0;
}

#include <iostream>

//I'm coming for you.    ...Winter

using namespace std;

#define N 2000001

int n;

long long stark[N];

int mepisSityva;

int main(){

	cin>>n;

	long long a[n],b[n];

	for(int i=0;i<n;i++)
		cin>>a[i],
		stark[a[i]]=1;

	for(int i=0;i<n;i++)
		cin>>b[i],
		stark[b[i]]=1;

	for(int i=0;i<n;i++)
		for(int j=0;j<n;j++)
			if(i!=j)
				continue;
			else
				if(stark[a[i] xor b[j]]==1)
					mepisSityva++;

	if(mepisSityva%2==0)
		cout<<"Karen";
	else
		cout<<"Koyomi";

}

#include <iostream>
#include <stdio.h>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <string>
#include <memory.h>
#include <algorithm>
#define ll long long
#define f(i, x, n) for(int i = x; i < (int)(n); ++i)
#define all(v) ((v).begin()),((v).end())
#define MOD 1000000007
using namespace std;
int const N = 2*1e6 + 2;
ll a[N],b[N];
bool trueVaule[N];
int main(){
	#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	#endif
	int n;
	scanf("%d", &n);
	f(i, 0, n) {
		scanf("%d", &a[i]);
		trueVaule[a[i]] = 1;
	}
	f(i, 0, n) {
		scanf("%d", &b[i]);
		trueVaule[b[i]] = 1;
	}
	int count = 0;
	f(i, 0, n) {
		f(j, 0, n) {
			ll ans = a[i] ^ b[j];
			if (trueVaule[ans]) {
				count++;
			}
		}
	}
	if (count % 2) printf("Koyomi\n");
	else printf("Karen\n");
	return 0;
}

#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <sstream>
#include <algorithm>
using namespace std;

vector<int> karen, koyemi;
vector < int> used;

int main()
{

	int n = 3;
	cin >> n; int tmp;
	for (int i = 0; i < n; i++)
	{
		cin >> tmp;
		koyemi.push_back(tmp);
		used.push_back(tmp);
	}
	for (int i = 0; i < n; i++)
	{
		cin >> tmp;
		karen.push_back(tmp);

		used.push_back(tmp);
	}
	int counter = 0;
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			int val = koyemi[i] ^ karen[j];
			vector < int>::iterator it = lower_bound(used.begin(), used.end(), val);
			if ( it!= used.end() && *it==val)
			{
				counter++;
			}
		}
	}
	if (counter % 2 == 0)cout << "Karen";
	else cout << "Koyomi";
	return 0;
	int b=1;
}

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int n = 0, m = 0, l = 0, l1 = 0, l2 = 0, l3 = 0, l4 = 0, l5 = 2000001;
    cin >> n;
    vector<string> buf(l5, "");
    vector<int> buf1(n, 0);
    vector<int> buf2(n, 0);
    vector<int> buf3(l5, 0);
    for (int i = 0; i < n; i++)
    {
        cin >> l;
        m = l;
        while (m > 1)
        {
            if (m % 2 > 0)
            {
                buf[l] += '1';
            }
            else
            {
                buf[l] += '0';
            }
            m /= 2;
        }
        buf[l] += '1';
        reverse(buf[l].begin(), buf[l].end());
        buf1[i] = l;
        buf3[l] = 1;
    }
    for (int i = 0; i < n; i++)
    {
        cin >> l;
        m = l;
        while (m > 1)
        {
            if (m % 2 > 0)
            {
                buf[l] += '1';
            }
            else
            {
                buf[l] += '0';
            }
            m /= 2;
        }
        buf[l] += '1';
        reverse(buf[l].begin(), buf[l].end());
        buf2[i] = l;
        buf3[l] = 1;
    }
    sort(buf1.begin(), buf1.end());
    sort(buf2.begin(), buf2.end());
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            l1 = buf[buf1[i]].size();
            l2 = buf[buf2[j]].size();
            if (buf1[i] > buf2[j])
            {
                buf[0] = buf[buf1[i]];
                l = l1;
            }
            else
            {
                buf[0] = buf[buf2[j]];
                l = l2;
            }
            l3 = l;
            while(true)
            {
                l1--;
                l2--;
                l3--;
                if (buf[buf1[i]][l1] !=  buf[buf2[j]][l2])
                {
                    buf[0][l3] = '1';
                }
                else
                {
                    buf[0][l3] = '0';
                }
                if (l1 == 0 || l2 == 0)
                {
                    break;
                }
            }
            m = 0;
            for (int ii = 0, jj = l - 1; jj > -1; ii++, jj--)
            {
                if (buf[0][ii] > '0')
                {
                    m += int(pow(2.0, jj));
                    if (m >= l5)
                    {
                        m = 0;
                        j = n;
                        break;
                    }
                }
            }
            if (buf3[m] == 1)
            {
                l4++;
            }
        }
    }
    if (l4 % 2 > 0)
    {
        cout << "Koyomi";
    }
    else
    {
        cout << "Karen";
    }
}

//#define _CRT_NO_WARNINGS
#include <vector>
#include <iostream>
#include <fstream>
#include <list>
#include <string>
#include <set>

#define MAX(x, y) (((x) > (y)) ? (x) : (y))
#define MIN(x, y) (((x) < (y)) ? (x) : (y))

using namespace std;
int n;
int main()
{
	/*ifstream fin("input.txt");
	ofstream fout("output.txt");*/
	cin >> n;
	vector <long long>x, y;
	set <long long>	all;
	for (int i = 0; i < 2*n; i++) {
		long long t;
		cin >> t;
		if (i < n) {
			all.insert(t);
			x.push_back(t);
		} else {
			all.insert(t);
			y.push_back(t);
		}
	}
	int count = 0;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (all.find(x[i] ^ y[i]) != all.end()) {
				count++;
			}
		}
	}

	cout << ((count % 2) ? "Koyomi" : "Karen") << std::endl;
	//system("pause");
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

bool C[2000010];

int main()
{

    vector<int> A;
    vector<int> B;
    long long cnt=0;

    int n,a;
    cin>>n;

    for (int i=0;i<n;i++)
    {
        cin>>a;
        A.push_back(a);
        C[a]=true;
    }

    for (int i=0;i<n;i++)
    {
        cin>>a;
        B.push_back(a);
        C[a]=true;
    }

    for (int i=0;i<n;i++)
    {
        for (int j=0;j<n;j++)
        {
            if (C[A.at(i)^B.at(j)]==true)
                cnt++;
        }
    }

    if (cnt%2==0)
        cout<<"Karen";
    else cout<<"Koyomi";

    return 0;
}

#include <bits/stdc++.h>
using namespace std;

long long n,i,j,ans,cnt,mid,l,now,r;
int main(){
  cin >> n;
  long long a[n+10];
  long long b[n+10];
  for (i = 0; i < n; i++) cin >> a[i];
  for (i = 0; i < n; i++) cin >> b[i];
  sort(b,b+n);
  // for (i = 0; i < n; i++) cout << b[i] << endl;
  cnt = 0;
  for (i = 0; i < n; i++){
    for (j = 0; j < n; j++){
      now = a[i]^b[j];
      if (now <= (2*n)) cnt += 1;
      // l = 0;
      // r = n-1;
      // // mid = (l+r)/2;
      // while(l < r){
      //   mid = (l+r)/2;
      //   if (b[mid] == now) break;
      //   else if (b[mid] < now) l = mid+1;
      //   else if (b[mid] > now) r = mid-1;
      // }
      // cout << now << endl;
      // if (b[mid] == now) cnt += 1;
    }
  }
  // cout << cnt << endl;
  if (cnt%2 == 0) cout << "Karen" << endl;
  else cout << "Koyomi" << endl;
}

#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <sstream>
#include <algorithm>
using namespace std;

vector<int> karen, koyemi;
vector < int> used;

int main()
{

	int n=3;
	cin >> n; int tmp;
	for (int i = 0; i < n; i++)
	{
		cin >> tmp;
		koyemi.push_back(tmp);
		used.push_back(tmp);
	}
	for (int i = 0; i < n; i++)
	{
		cin >> tmp;
		karen.push_back(tmp);

		used.push_back(tmp);
	}
	int counter = 0;
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			int val = koyemi[i] ^ karen[j];
			if (lower_bound(used.begin(),used.end(), val)!=used.end())
			{
				counter++;
			}
		}
	}
	if (counter % 2 == 0)cout << "Karen";
	else cout << "Koyomi";
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<pll,pll> ppll;
typedef long double ld;

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fst first
#define snd second
#define ins insert
#define pb push_back

const int N = 5e5 + 5;
const int MOD = 1e9 + 7;
int a[N],b[N];
int cnt = 0;
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //freopen(".in", "r", stdin);
    //freopen(".out", "w", stdout);
    int n;
    cin >> n;
    for(int i = 0;i < n; ++i){
        cin >> a[i];
    }
    for(int i = 0;i < n; ++i){
        cin >> b[i];
    }
    for(int i = 0;i < n; ++i){
        for(int j = 0;j < n; ++j){
            int z = a[i] ^ b[j];
            if(1 <= z && z <= 2 * n)cnt++;
        }
    }
    if(cnt % 2 == 0)cout << "Karen";else cout << "Koyomi";
    return 0;
}

#include<iostream>
#include<string>

using namespace std;

int main()
{
	long long n;
	long int x[2001];
	long int y[2001];
	int sch = 0;
	cin >> n;
	for (int i = 1; i <= n; i++)
		cin >> x[i];
	for (int i = 1; i <= n; i++)
		cin >> y[i];

	for (int i = 1; i <= n; i++)
		for(int j=1;j<=n;j++)
	{
			if ((x[i] ^ y[j]) < (2*n))
				sch++;

	}
	if (sch % 2 == 0)
		cout << "Karen";
	else
		cout << "Koyomi";

	return 0;
}

#include <bits/stdc++.h>
#define st first
#define nd second

using namespace std;
typedef long long LL;
typedef pair <int, int> pr;

const int mx = 2e6 + 10;
const int md = 1e9 + 7;

int n, a[mx], b[mx], cnt = 0, p[mx];

int main() {
      //freopen("v.txt", "r", stdin);
      //freopen("", "w", stdout);
      //ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

      cin >> n;
      for (int i = 1; i <= n; i ++) cin >> a[i], p[a[i]] ++;
      for (int i = 1; i <= n; i ++) cin >> b[i], p[b[i]] ++;

      for (int i = 1; i <= n; i ++)
            for (int j = 1; j <= n; j ++) cnt += p[a[i] ^ b[j]];

      if (cnt % 2) cout << "Koyomi";
      else cout << "Karen";

      return 0;
}

#include <bits/stdc++.h>
using namespace std;

int f(int n, int m)
{
    // array to store binary number
    int binaryNum[32] = {0};
    int binaryNumb[32] = {0};

    // counter for binary array
    int i = 0;
    while (n > 0) {

        // storing remainder in binary array
        binaryNum[i] = n % 2;
        n = n / 2;
        i++;
    }
    i = 0;
    while (m > 0) {

        // storing remainder in binary array
        binaryNumb[i] = m % 2;
        m = m / 2;
        i++;
    }

    for(int i = 0; i<32; i++){
        binaryNum[i] = binaryNum[i] xor binaryNumb[i];
    }

    int out = 0;
    for(int i=0; i<32; i++){
        out += binaryNum[i]*(2^i);
    }

    return out;
}

int main() {
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n;
    cin >> n;

    int x[n],y[n];
    int tmp, result = 0;
    set<int> s;
    for(int i=0; i<n; i++){
        cin >> x[i];
        s.insert(x[i]);
    }

    for(int i=0; i<n; i++){
        cin >> y[i];
        s.insert(y[i]);
    }

    for(int i=0; i<n; i++){
        for(int j=0; j<2*n; j++){
            tmp = f(x[i],y[j]);
            if( s.find(tmp) != s.end() ){
                result++;
            }
        }
    }

    if(result%2 == 0){
        cout << "Karen" << endl;
    }else{
        cout << "Koyomi" << endl;
    }

	// your code goes here
	return 0;
}

#include<iostream>
#include<string>

using namespace std;

int x[4002];
int main()
{
	long long n;
	long int y[2001];

	int sch = 0;
	long int max = 0;
	cin >> n;

	for (int i = 1; i <= n; i++)
		cin >> x[i];
	for (int i =1+n; i <= n+n; i++)
		cin >> x[i];
	//for (int i = n; i <= 2*n; i++)

	for (int i = 1; i <= n; i++)
		for(int j=1+n;j<=2*n;j++)
	{
			long long gg = x[i] ^ x[j];
			if (gg <= 2 * n && x[gg] != 0)
			{
				sch++;
			}
//			for (int y = 1; y <= 2 * n; y++)
	//			if (x[i] ^ x[j] == x[y])
	//				sch++;

	}
	if (sch % 2 == 0)
		cout << "Karen";
	else
		cout << "Koyomi";

	return 0;
}

#include <iostream>
#include <vector>

using namespace std;

int main()	{
	int n;
	cin >> n;
	int karenNum[n];
	int koyomiNum[n];
	bool inList[2097152]; //2**21 is maximum since 2*10^6 gives 21 bits
	for (int i = 0; i < n; ++i)	{
		cin >> karenNum[i];
		inList[karenNum[i]] = true;
	}
	for (int i = 0; i < n; ++i)	{
		cin >> koyomiNum[i];
		inList[koyomiNum[i]] = true;
	}
	int numSatisfied = 0;
	for (int i = 0; i < n; ++i)	{
		for (int j = 0; j < n; ++j)	{
			if (inList[karenNum[i]^koyomiNum[j]] == true)	{
				numSatisfied++;
			}
		}
	}
	if (numSatisfied % 2 == 0)	{
		cout << "Karen";
	} else	{
		cout << "Koyomi";
	}
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

bool C[2000001];

int main()
{
    fill_n(C,2000000,false);
    vector<int> A;
    vector<int> B;
    long long cnt=0;

    int n,a;
    cin>>n;

    for (int i=0;i<n;i++)
    {
        cin>>a;
        A.push_back(a);
        C[a]=true;
    }

    for (int i=0;i<n;i++)
    {
        cin>>a;
        B.push_back(a);
        C[a]=true;
    }

    for (int i=0;i<n;i++)
    {
        for (int j=0;j<n;j++)
        {
            if (C[A.at(i)^B.at(j)]==true)
                cnt++;
        }
    }

    if (cnt%2==0)
        cout<<"Karen";
    else cout<<"Koyomi";

    return 0;
}

#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <sstream>
#include <algorithm>
using namespace std;

vector<int> karen, koyemi;
vector < int> used;

bool bs(int l, int r, int val)
{
	if (l != r)
	{

		int mid = (l + r) / 2;
		if (val == used[mid])return true;
		else
		{
			if (val > used[mid])l = mid + 1;
			else r = mid - 1;
		}
		bs(l, r, val);
	}
	else
	{
		if (val == used[l])return true;
		else return false;
	}
}

int main()
{

	int n = 3;
	cin >> n; int tmp;
	for (int i = 0; i < n; i++)
	{
		cin >> tmp;
		koyemi.push_back(tmp);
		used.push_back(tmp);
	}
	for (int i = 0; i < n; i++)
	{
		cin >> tmp;
		karen.push_back(tmp);

		used.push_back(tmp);
	}
	int counter = 0;
	sort(used.begin(), used.end());
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			int val = koyemi[i] ^ karen[j];
			if (bs(0,n*2-1,val))
			{
				counter++;
			}
		}
	}
	if (counter % 2 == 0)cout << "Karen";
	else cout << "Koyomi";
	return 0;
}

/** Source code by WDragon **/
#include<bits/stdc++.h>
#define ll long long
#define MAX 2000003
#define pii pair<int,int>
#define VP vector< pii >
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define rep(i,a,b) for(int (i) = (a); (i) < (b); (i)++)
#define S(x) scanf("%d",&(x))
#define S2(x,y) scanf("%d%d",&(x),&(y))
#define P(x) printf("%d\n",(x))
#define all(v) (v).begin(),(v).end()
#define FF first
#define SS second
using namespace std;
//int dx[]={1,0,0,-1},dy[]={0,1,-1,0};
int v[MAX];
int main(){
int n,a[3000],b[3000];
S(n);
rep(i,0,n){
S(a[i]);
v[a[i]]=1;
}
rep(i,0,n){
	S(b[i]);
	v[b[i]]=1;
}
int cnt=0;
rep(i,0,n){
	rep(j,0,n){
		if(v[a[i]^b[j]]==1)
			++cnt;
		if(v[b[j]^a[i]]==1)
			++cnt;
	}
}
cout<<cnt<<endl;
if(cnt%2){
	printf("Koyomi\n");
}
else
printf("Karen\n");
return 0;
}
/**	Who knows what lies above :P **/

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll v[10000020];
int main()
{
    ll n;
    cin>>n;
    ll a[2020],b[2020];
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
        v[a[i]]=1;
    }
    for(int i=0;i<n;i++)
    {
        cin>>b[i];
        v[b[i]]=1;
    }
    ll c=0;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            if(v[a[i]^b[i]])
            c++;
        }
    }
    if(c%2)
    cout<<"Koyomi"<<endl;
    else
    cout<<"Karen"<<endl;
}

#include <bits/stdc++.h>

using namespace std;

const int N = 2e6 + 5;

int n, a[N], cnt, x[2010], y[2010];

int main() {
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> x[i];
        a[x[i]] = 1;
    }
    for (int i = 0; i < n; ++i) {
        cin >> y[i];
        a[y[i]] = 1;
    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            cnt += a[x[i] ^ y[j]];
        }
    }
    cout << (cnt % 2 ? "Koyomi" : "Karen");
}

#include <algorithm>
#include <iostream>
using namespace std;

int main(){

 int n=0,s=0,k=0;
 cin>>n;

 int *a=new int [n];
 int *b=new int [n];
 int *c=new int [2*n];

 for(int i=0;i<n;i++){
    cin>>a[i];
    c[i]=a[i];
 }

 for(int i=0;i<n;i++){
    cin>>b[i];
    c[n+i]=b[i];
 }

 sort(c,c+2*n);

 int bin=0,len1=0,len2=0,ch=0;
 bool f=false;
 for(int i=0;i<n;i++  ){
    for(int j=0;j<n;j++){
            s=a[i]^b[j];
        if( c[0]<=s && c[2*n-1]>=s  ){
            len1=0;len2=n*2;bin=len2/2;ch=0;f=false;
            while(!f){
                if( s>c[bin])len1=bin;
                if( s<c[bin])len2=bin;
                if( c[bin]==s ){f=true;break;}
                bin=(len1+len2)/2;
                ch++;
                if( ch==n/2 )break;
            }
            if(f){
                k++;
            }
        }

    }
 }

if( k%2==0 )cout<<"Karen"; else cout<<"Koyomi";
return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define pc(x) putchar(x)
namespace ib {char b[100];}
inline void pi(int x){
	if(x==0) {pc(48); return;}
	if(x<0) {pc('-'); x=-x;}
	char *s=ib::b;
	while(x) *(++s)=x%10,x/=10;
	while(s!=ib::b) pc((*(s--))+48);
}
inline void ri(int &x){
	x=0; static char c; bool t(0);
	while(c=getchar(),c<'0'||c>'9') if(c=='-') t=1; else t=0;
	do x=(x<<1)+(x<<3)+c-'0'; while(c=getchar(),c>='0'&&c<='9');
	if(t) x=-x;
}
const int N=10000024;
int a[N],b[N];
int vis[2000200];
int main(){
	int i,j,n,gs=0; ri(n);
	for(i=1;i<=n;++i) ri(a[i]),vis[a[i]]=1;
	for(i=1;i<=n;++i) ri(b[i]),vis[b[i]]=1;
	for(i=1;i<=n;++i)
	for(j=1;j<=n;++j) if(vis[a[i]^b[j]]) ++gs;
	if(gs&1) puts("Koyomi"); else puts("Karen");
	return 0;
}

#include <bits/stdc++.h>
#define st first
#define nd second

using namespace std;
typedef long long LL;
typedef pair <int, int> pr;

const int mx = 2e6 + 10;
const int md = 1e9 + 7;

int n, a[mx], b[mx], cnt = 0, p[mx] = {0};

int main() {
      //freopen("v.txt", "r", stdin);
      //freopen("", "w", stdout);
      //ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

      cin >> n;
      for (int i = 1; i <= n; i ++) cin >> a[i], p[a[i]] ++;
      for (int i = 1; i <= n; i ++) cin >> b[i], p[b[i]] ++;

      for (int i = 1; i <= n; i ++)
            for (int j = 1; j <= n; j ++) if (p[(int)a[i] ^ b[j]]) cnt ++;

      if (cnt % 2) cout << "Koyomi";
      else cout << "Karen";

      return 0;
}

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
const int INF = 0x3f3f3f3f;
int A[5050],B[5050],vis[100010];
int cnt;
int main(){
	int n;
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
		scanf("%d",&A[i]),vis[A[i]]=1;
	for(int i=1;i<=n;i++)
		scanf("%d",&B[i]),vis[B[i]]=1;
	//for(int i=1;i<=100000;i++)
	//	if(vis[i]) printf("%d ",i);
	for(int i=1;i<=n;i++)
	for(int j=1;j<=n;j++)
		if(vis[A[i]^B[i]]) cnt++;
	printf("%d",cnt);
	return 0;
}

#include <iostream>

//I'm coming for you.    ...Winter

using namespace std;

#define N 3000003

int n;

long long stark[N];

int mepisSityva;

int main(){

	cin>>n;

	long long a[n],b[n];

	for(int i=0;i<n;i++)
		cin>>a[i],
		stark[a[i]]=1;

	for(int i=0;i<n;i++)
		cin>>b[i],
		stark[b[i]]=1;

	for(int i=0;i<n;i++)
		for(int j=0;j<n;j++)
			if(i==j)
				continue;
			else
				if(stark[a[i] xor b[j]]==1)
					mepisSityva++;

	if(mepisSityva%2==0)
		cout<<"Karen";
	else
		cout<<"Koyomi";

}

/*************************************************************************
	> File Name: 1.cpp
	> Author: mazicwong
	> Mail: mazicwong@gmail.com
	> Created Time: 2017年10月06日 星期五 21时34分56秒
 ************************************************************************/

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <vector>
#include <queue>
#include <stack>
#include <set>
using namespace std;
const int maxn = 2000+5;
int x[maxn],y[maxn];
map<int,int> mp;
int main()
{
    //freopen("in","r",stdin);
    int n;cin>>n;
    mp.clear();
    for (int i=0;i<n;i++)
    {
        scanf("%d",&x[i]);
        mp[x[i]]++;
    }
    for (int i=0;i<n;i++)
    {
        scanf("%d",&y[i]);
        mp[y[i]]++;
    }
    int cnt=0;
    for (int i=0;i<n;i++)
    {
        for (int j=0;j<n;j++)
        {
            if (mp[x[i]^y[i]])
            {
                cnt++;
            }
        }
    }
    if (cnt%2==0)
    {
        cout << "Karen";
    }
    else cout << "Koyomi";

    return 0;
}

#include <bits/stdc++.h>
#include<math.h>
using namespace std;

#define ll long long

vector <ll> v;
vector <ll> vv;
set <ll> st;

ll x,y,z;
string s,s1,s2,s3,s4,s5;

void memset_ll(ll a[], ll v, ll n)
{
    for(ll i=0; i<n; i++)
        a[i]=v;
}
void memset_s(char a[], char v, ll n)
{
    for(ll i=0; i<n; i++)
        a[i]=v;
}

int compare(const void * a, const void * b)
{
    return ( *(ll*)a - *(ll*)b );
}
void q_sort(ll a[], ll n)
{
    qsort(a, n, sizeof(ll), compare);
}

static int compare1 (const void * a, const void * b)
{
    if (*(double*)a > *(double*)b)
        return 1;
    else if (*(double*)a < *(double*)b)
        return -1;
    else
        return 0;
}
void q_sort_d(double a[], ll n)
{
    qsort(a, n, sizeof(double), compare1);
}

string trans_upper(string ss)
{
    transform(ss.begin(),ss.end(),ss.begin(), ::toupper);
    return ss;
}

ll power(ll a, ll b)
{
    ll pow = 1;
    while ( b )
    {
        if ( b & 1 )
        {
            pow = pow * a;
            --b;
        }
        a = a*a;
        b = b/2;
    }
    return pow;
}

ll bsearch(ll arr[], ll l, ll r, ll x)
{
    if (r >= l)
    {
        ll mid = l + (r - l) / 2;
        if (arr[mid] == x)
            return mid;
        if (arr[mid] > x)
            return bsearch(arr, l, mid - 1, x);
        return bsearch(arr, mid + 1, r, x);
    }
    return -1;
}

ll fact(ll n)
{
    ll f=1,i;
    for(i=1; i<=n; i++)
        f=f*i;
    return f;
}

ll is_prime(ll n)
{
    ll i,j,k=1;
    for(i=2; i<=n/2; i++)
    {
        if(n%i==0)
        {
            k=0;
            break;
        }
    }
    return k;
}

ll vow(char c)
{
    ll k=1;
    ll l=0;
    if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u')
        return k;
    else
        return l;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL) ;
    cout.tie(NULL) ;

    ll t,l,p,q,n,m,o=0,r,i,j,h,k,e=0,d=0,f=0,g=0;
    ll temp=0,nl,np;
    double p1,p2=0.0,p3=0.0,p4,p5,p6,pp=0.0,ppp;
    p1=3.1415926536;
    ll x1,x2,y1,y2,uu=0,dd=0,rr=0,lll=0;
    cin>>n;
    ll a[n];
    ll b[n];
    m=2*n;
    ll c[m];
    for(i=0;i<n;i++)
    {
        cin>>a[i];
        c[d]=a[i];
        d++;
    }
    for(i=0;i<n;i++)
    {
        cin>>b[i];
        c[d]=b[i];
        d++;
    }
    q_sort(c,m);
    for(i=0;i<n;i++)
    {
        p=a[i]^b[i];
        t=bsearch(c,0,m-1,p);
        if(t!=-1)
            e++;
    }
    if(e%2==0)
        cout<<"Karen";
    else
        cout<<"Koyomi";

    return 0;
}

#include <iostream>
using namespace std;

int main()
{
    int n,np=0;
    cin >> n;
    int a[n+1],b[n+1];
    for(int i=1;i<n+1;i++)
        cin >> a[i];
    for(int i=1;i<n+1;i++)
        cin >> b[i];
    for(int i=1;i<n+1;i++)
    {
        for(int j=1;j<n+1;j++)
        {
          int r= a[i] xor b[j];
          for(int k=1;k<n+1;k++)
                {
                    if(r==a[k] || r==b[k])
                        np+=(i==j)?1:2;
                }

        }
    }
    if(np%2 == 0)
        cout <<  "Karen" << endl;
    else
        cout <<  "Koyomi" << endl;

}

#include <iostream>
#include <stdio.h>
using namespace std;

int p[2000001];
int main()
{
  int n,k(0),q;
  int X[2001],Y[2001];
  cin >> n;
  for(int i=0;i<n;i++)
  {
    cin >> X[i];
    p[X[i]]=1;
  }
  for(int i=0;i<n;i++)
  {
    cin >> Y[i];
    p[Y[i]]=1;
  }
  for(int i=0;i<n;i++)
    for(int j=0;j<n;j++)
        if(p[X[i]^Y[j]])
            {
                k++;
                //q=X[i] ^ Y[j];
                //cout << "i="<< i<<" "<< "j="<<j <<" "<< q<< endl;
            }
   if(k%2==0)
    cout << "Karen";
   else
    cout << "Koyomi";
}

#define _CRT_SECURE_NO_WARNINGS
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#include <set>
#include <map>
#include <deque>
#include <cmath>
#include <queue>
#include <random>
#include <bitset>
#include <time.h>
#include <string>
#include <cstdio>
#include <vector>
#include <cassert>
#include <iomanip>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
#define endl '\n'
#define mp make_pair
#define pbc push_back
#define pob pop_back()
#define empb emplace_back
#define sp system("pause")
#define queuel queue<long long>
#define all(x) (x).begin(), (x).end()
#define matrix vector<vector<ll>>
#define pin(p) cin >> p.first >> p.second;
#define rev(v) reverse(v.begin(), v.end());
#define mx(a) max_element(a.begin(), a.end());
#define mn(v) min_element(v.begin(), v.end());
#define sout(s, c) for (auto i : s) cout << i << c;
#define pout(p) cout << p.first << " " << p.second;
#define er(v, l, r) erase(v.begin() + l, v.begin() + r);
#define vin(v) for (ll i = 0; i < v.size(); ++i) cin >> v[i];
#define vout(v, c) for (int i = 0; i < v.size(); ++i) cout << v[i] << c;
#define pushi(v, a) for (int i = 0; i < a.size(); ++i) v.push_back(a[i]);
#define sin(s, n) for (int i = 0; i < n; ++i){int a; cin >> a; s.insert(a);}
#define fastio() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
using namespace std;
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<vector<char> > fd;
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
const ll INF = 1e18;
const int inf = 1e9;
const ld PI = acos(-1.0);
const ll mod1 = inf + 7;
const ll mod2 = inf + 9;
const int MAXN = 100001;
const ld EPS = 1.0e-8;

signed main()
{
	fastio();
	int n;
	cin >> n;
	if (n & 1)
	{
		cout << "Karen";
	}
	else
	{
		cout << "Koyomi";
	}

}

#include <bits/stdc++.h>

using namespace std;

int main( void )
{
    long int n, count = 0, largest = 0;

    cin >> n;

    long int x[n * 2];

    for(int i = 1; i <= (n * 2); i++ )
    {
        cin >> x[i];
        if( largest < x[i] )
        {
            largest = x[i];
        }
    }

    for(int i = 1; i <= n; i++ )
    {
        for(int j = n + 1; j <= n * 2; j++ )
        {
            long int y = ( x[i] ^ x[j] );
            if( y <= largest )
            {
                count++;
            }
        }
    }

    if( count % 2 == 0)
    {
        cout << "Karen\n";
    }
    else
    {
        cout << "Koyomi\n";
    }

    return 0;
}

#define ONLINE_JUDGE
#include <bits/stdc++.h>

#define inf 0x3f3f3f3f

#define INF 0x3f3f3f3f3f3f3f3fLL

#define mod 1000000007

#define pb push_back

#define sq(x) ((x)*(x))

#define sz(a) ((int)a.size())

#define x first

#define y second

#define eps 1e-8

#define bpt(x) (__builtin_popcount(x))

#define bptl(x) (__builtin_popcountll(x))

#define bit(x, y) (((x)>>(y))&1)

#define bclz(x) (__builtin_clz(x))

#define bclzl(x) (__builtin_clzll(x))

#define bctz(x) (__builtin_ctz(x))

#define bctzl(x) (__builtin_ctzll(x))

#define rands(n) (rand()%n+1)

#define rand0(n) (rands(n)-1)

#define Rands(n) ((INT)rand()*rand()%n+1)

#define Rand0(n) (Rands(n)-1)

#define PQ priority_queue<pii, vector<pii>, greater<pii> >

#define rep(i, a, b) for(int i=a; i<b; i++)

using namespace std;

typedef long long INT;

typedef vector<int> VI;

typedef pair<int, int> pii;

typedef pair<INT, INT> PII;

typedef pair<pii, int> ppi;

typedef double DO;

template<typename T, typename U> inline void smin(T &a, U b) {if (a>b) a=b;}

template<typename T, typename U> inline void smax(T &a, U b) {if (a<b) a=b;}

template<class T>inline void gn(T &x) {char c, sg=0; while (c=getchar(), (c>'9' || c<'0') && c!='-');for((c=='-'?sg=1, c=getchar():0), x=0; c>='0' && c<='9'; c=getchar()) x=(x<<1)+(x<<3)+c-'0';if (sg) x=-x;}

template<class T>inline void print(T x) {if (x<0) {putchar('-');return print(-x);}if (x<10) {putchar('0'+x);return;} print(x/10);putchar(x%10+'0');}

int power(int a, int b, int m, int ans=1) {

	for (; b; b>>=1, a=1LL*a*a%m) if (b&1) ans=1LL*ans*a%m;

	return ans;

}

#if ( ( _WIN32 || __WIN32__ ) && __cplusplus < 201103L)

    #define lld "%I64d"

#else

    #define lld "%lld"

#endif

#define MM 3000

int a[MM], b[MM], c[MM];

int cnt, tot, N;

int main() {

#ifndef ONLINE_JUDGE

	freopen("in.txt", "r", stdin);

	int _time=clock();

#endif

	scanf("%d", &N);

	for(int i=0; i<N; i++)

		scanf("%d", a+i);

	for(int i=0; i<N; i++)

		scanf("%d", b+i);

	for(int i=0; i<N; i++){

		for(int j=0; j<N; j++){

			c[cnt++]=a[i]^b[j];

		}

	}

	sort(c, c+cnt);

	for(int i=0; i<cnt-1; i++){

		if(c[i]==c[i+1]) tot++;

	}

	if(tot%2==0) puts("Koyomi");

	else puts("Karen");

#ifndef ONLINE_JUDGE

	cerr<<"time:"<<(int)(clock()-_time)<<endl;

#endif

	return 0;

}

/*
I seek protection in ALLAH, from the accursed Satan
In the name of ALLAH, the Benificent, the Merciful

xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
x                 Author                  x
x          -------------------            x
x           S.M. Rashedul Islam           x
x             Dept.of CSE,IU              x
x                  Kushtia                x
xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
*/

#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define mxm 2e18
#define fr(i,a) for(i=0;i<a;i++)
#define frr(i,n,m) for(i=n;i<=m;i++)
#define sf(a) scanf("%lld",&a)
#define sf2(a,b) scanf("%lld %lld",&a,&b)
#define sf3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define pf(a) printf("%lld\n",a)
#define pf2(a,b) printf("%lld %lld\n",a,b)
#define pf3(a,b,c) printf("%lld %lld %lld\n",a,b,c)
#define NL printf("\n")

using namespace std;

int check[2000005];

int main(int argc, char const *argv[])
{
	int test;
	while(cin>>test)
	{
		vector<int>s1;
		vector<int>s2;
		int a,c,cn=0,i,j;
		fr(i,test)
		{
			cin>>a;
			s1.push_back(a);
			check[a]++;
		}
		fr(i,test)
		{
			cin>>a;
			s2.push_back(a);
			check[a]++;
		}
		fr(i,test)
		{
			fr(j,test)
			{
				c=s1[i]^s2[j];
				if(check[c]!=0)
				{
				   cn++;
				   //check[c]=0;
				}
			}
		}
		//cout<<cn<<endl;
		if(cn%2!=0)
		{
			cout<<"Koyomi"<<endl;
		}
		else
		{
			cout<<"Karen"<<endl;
		}
	}
	return 0;
}

#include<iostream>
#include<algorithm>
#include<map>
using namespace std;
#define fo(a,b) for(int i = a;i<b;i++)
#define ll long long
int main()
{
	map<int, int>mark;
	int n, count = 0;
	int x[2000], y[2000];
	cin >> n;
	fo(0, n) {
		cin >> x[i];
		mark[x[i]]++;
	}
	fo(0, n) {
		cin >> y[i];
		mark[y[i]]++;
	}
	fo(0, n)
	{
		fo(0, n)
		{
			if (mark[x[i] ^ y[i]])
				count++;
		}
	}
	if (count % 2 == 0)
		cout << "Karen";
	else cout << "Koyomi";
	//system("pause");
}

#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define f(i,x,n) for(ll int i=x;i<n;i++)
#define re(j,x,n) for(ll int j=x;j>=n;j--)
#define f1(k,x,n) for(ll int k=x;k<=n;k++)
#define mp make_pair
#define pb push_back
#define mod 1000000007
using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll int n;
    cin>>n;
    bool a[2000001];
     memset(a,false,sizeof(a));
    ll int x[n];
    f(i,0,n)
    {
      cin>>x[i];
      a[x[i]]=true;
    }
    ll int y[n],count=0;
    f(i,0,n)
    {
      cin>>y[i];
      a[y[i]]=true;
    }
    f(i,0,n)
    {
      f(j,0,n)
      {
      	if(a[x[i]^y[j]])
      	{
      	  count++;
        }
       }
     }
    if(count%2==0)
    {
      cout<<"Karen";
    }
    else
    cout<<"Koyomi";

}

#include<bits/stdc++.h>
using namespace std;

int a[2005], b[2005];

int main()
{
    string s[2] = {"Karen", "Koyomi"};

    int n, r = 0;

    cin>>n;

    for(int i = 0; i<n; i++) cin>>a[i];

    for(int i = 0; i<n; i++)
    {
        for(int j = 0; j<n; j++)
        {
            int x = (a[i]^b[i]);

            if(x && x<=2*n) r ^=1;

        }
    }

    cout<<s[r]<<endl;

}

#include <iostream>

using namespace std;

int n;
int a[2005], b[2005];

int main(){
    cin>>n;
    for (int i=1; i<=n; i++) cin>>a[i];
    for (int i=1; i<=n; i++) cin>>b[i];
    int cnt = 0;
    for (int i=1; i<=n; i++)
        for (int j=1; j<=n; j++)
            cnt += ((a[i] ^ b[j]) == 1);
    cout<<(cnt % 2 == 0 ? "Karen" : "Koyomi");
    return 0;
}

/*
 * aesth
 * Konstantinos Alatzas
 */

#include <bits/stdc++.h>

using namespace std;

#define afor(i,j,k,l) for(int i=j; i<=k; i+=l)
#define rfor(i,j,k,l) for(int i=j; i>=k; i-=l)
#define rep(i,j) afor(i,0,j-1,1)
#define rrep(i,j) rfor(i,j,0,1)
#define all(cont) cont.begin(),cont.end()
#define sz(cont) (int)cont.size()
#define pb push_back
#define inf(T) numeric_limits<T>::max()
#define minf(T) numeric_limits<T>::min()

typedef long long int lli;

int n, xi[2001], yi[2001], cnt;
set<int> s;

int main()
{
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin>>n;
	afor(i,1,n,1) cin>>xi[i], s.insert(xi[i]);
	afor(i,1,n,1) cin>>yi[i], s.insert(yi[i]);
	afor(i,1,n,1) afor(j,1,n,1) cnt+=s.count(xi[i]^yi[i]);
	if(cnt>0&&cnt%2==0) cout<<"Karen";
	else cout<<"Koyomi";
	return 0;
}

/*
I seek protection in ALLAH, from the accursed Satan
In the name of ALLAH, the Benificent, the Merciful

xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
x                 Author                  x
x          -------------------            x
x           S.M. Rashedul Islam           x
x             Dept.of CSE,IU              x
x                  Kushtia                x
xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
*/

#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define mxm 2e18
#define fr(i,a) for(i=0;i<a;i++)
#define fr1(i,n,m) for(i=n;i<=m;i++)
#define sf(a) scanf("%lld",&a)
#define sf2(a,b) scanf("%lld %lld",&a,&b)
#define sf3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define pf(a) printf("%lld\n",a)
#define pf2(a,b) printf("%lld %lld\n",a,b)
#define pf3(a,b,c) printf("%lld %lld %lld\n",a,b,c)
#define NL printf("\n")

using namespace std;

int check[2000005];

int main(int argc, char const *argv[])
{
	int test;
	while(cin>>test)
	{
		vector<int>s1;
		vector<int>s2;
		int a,c,cn=0,i,j;
		fr(i,test)
		{
			cin>>a;
			s1.push_back(a);
			check[a]++;
		}
		fr(i,test)
		{
			cin>>a;
			s2.push_back(a);
			check[a]++;
		}
		fr(i,test)
		{
			fr(j,test)
			{
				c=s1[i]^s2[j];
				if(check[c]!=0)
				{
				   cn++;
				   //check[c]=0;
				}
			}
		}
		//cout<<cn<<endl;
		if(cn%2!=0)
		{
			cout<<"Koyomi"<<endl;
		}
		else
		{
			cout<<"Karen"<<endl;
		}
	}
	return 0;
}

#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
	int n,i,j,k,ans=0,arr[10000];
	vector<int>v1;
	vector<int>v2;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%d",&k);
		v1.push_back(k);
	}
	for(i=0;i<n;i++)
	{
		scanf("%d",&k);
		v2.push_back(k);
	}
	for(i=0;i<n;i++)
	{
		k=v1[i]^v2[i];
		//printf("%d\t",k);
		if(find (v1.begin(), v1.end(), k)!=v1.end())
		ans++;
		else if(find (v2.begin(), v2.end(), k)!=v2.end())
		ans++;
	}
	//printf("%d",ans);
	if(ans%2==0)
	printf("Karen\n");
	else
	printf("Koyomi\n");
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
#define fst() ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define FOR(i,a,b) for(i=a;i<b;i++)
typedef long long ll;
bool visit[2000005];
int x[2005],y[2005],n;
int main()
{
  int i,j;
  memset(visit,0,sizeof(visit));
  scanf("%d",&n);
  for(i=0;i<n;i++)
  {
    scanf("%d",&x[i]);
    visit[x[i]]=true;
  }
  for(i=0;i<n;i++)
  {
    scanf("%d",&y[i]);
    visit[y[i]]=true;
  }
  int count=0;
  FOR(i,0,n)
  {
    FOR(j,0,n)
      if(visit[x[i]^y[i]]) count++;
  }
  if(count%2==0) printf("Karen\n");
  else printf("Koyomi\n");
  return 0;
}

#include <bits/stdc++.h>

using namespace std;
#define ll long long
template<class T> void p(vector<T>& a){ for(int i = 0;i < a.size();i++) cout << a[i] << " "; cout << endl; }
#define mp make_pair
#define pb push_back
#define pii pair< int,int>
#define pll pair< ll,ll >
#define vi vector<int>
#define ss second
#define ff first
#define vii vector<pii>
#define vll vector<pll>
#define vl vector<ll>
#define vb vector<bool>
#define f(i,a,b) for(i = a;i < b;i++)
#define rf(i,a,b) for(i = a;i >= b;i--)

int main(){
	ios_base::sync_with_stdio(false);
	int i,j,n;
	cin >> n;
	vi a(n);
	vi b(n);
	map<int,int> m;

	f(i,0,n){
		cin >> a[i];
		m[a[i]] = 1;
	}

	f(i,0,n){
		cin >> b[i];
		m[b[i]] = 1;
	}
	int cnt = 0;
	f(i,0,n){
		f(j,0,n){
			if(m.find(a[i]^b[i]) != m.end())
				cnt++;
		}
	}
	if(cnt%2 == 0) cout << "Karen\n";
	else cout << "Koyomi\n";

	return 0;
}

	#include <bits/stdc++.h>

#define mp make_pair
#define pb push_back

using namespace std;
typedef long long ll;
typedef long double ld;
int a[2020];
int b[2020];
int chisla[2000005];
int main()
{
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
::ios::sync_with_stdio(false);
int n;
int k = 1;
scanf("%d",&n);
for (int i = 0; i<n; ++i) {scanf("%d",&a[i]);chisla[a[i]]=1;}
	for (int i = 0; i<n; ++i) {scanf("%d",&b[i]);chisla[b[i]]= 1;}

int ans = 0;
for (int i = 0; i<n; ++i){
for (int j = 0; j<n; ++j){
if (chisla[a[i]^b[j]])++ans;

}

}

cout << (ans%2 == 0 ? "Karen" : "Koyomi");

return 0;
}

#include<bits/stdc++.h>
#define LL long long
#define IO ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
int ar[20000001];

int main()
{
    IO
    int n,sum = 0,cnt=0;
    int mx1=0, mx2=0,mx=0;

    cin>>n;
    int x[n+1], y[n+1];

    for(int i = 1; i <= n; i++)
    {
        cin >> x[i];
        mx1 = max(mx1, x[i]);
        ar[x[i]]++;
    }
    for(int i = 1; i <= n; i++)
    {
        cin >> y[i];
        mx2 = max(mx1, y[i]);
        ar[y[i]]++;
    }
    mx = max(mx1, mx2);
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
        {
            int p = x[i] ^ y[j];
            if(p > mx)continue;
                ar[p]++;

                if(ar[p] > 1 && p <= mx)
                {
                    cnt++;
                    ar[p] = 1;
                }
        }
    }
    if(cnt % 2 == 0 && cnt > 0)
    cout<<"Karen"<<endl;
    else
        cout<<"Koyomi"<<endl;
    return 0;

}

#include<bits/stdc++.h>
using namespace std;

typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef vector<int>  vi;
typedef long double ld;
typedef long long ll;
const char *fi ="";
const char *fo ="";
const int  MAXN = 2000006;
const ll oo = 1e9;
const ld EPS = 1e-9;

int n,x[MAXN],y[MAXN];
bool ma[MAXN]={false};

int main()
{
	//freopen("t.txt","r",stdin);
	cin>>n;
	for (int i=1;i<=n;i++) {scanf("%d",&x[i]);ma[x[i]]=true;}
	for (int i=1;i<=n;i++) {scanf("%d",&y[i]);ma[y[i]]=true;}

	int d=0;
	for (int i=1;i<=n;i++){
        for (int j=1;j<=n;j++){
            if (ma[x[i]^y[j]]==true){
                d++;
            }
        }

	}
	if (d%2) {cout<<"Koyomi";}
	else {cout<<"Karen";}
	//cout << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";//cout << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
}

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#include<iostream>
#include<map>
using namespace std;
#define maxn 1e9+7
#define ll long long int

int koy[200005],kar[200005];

int BinarySea(int *a,int n,int x)
{
    int left = a[0],right = a[n-1];
    int mid;
    for(int i = 0;i < 100&&left < right;i++){
        mid = (right + left)/2;
        if(mid > x){
            right = mid;
        }
        else if(mid < x) left = mid;
        else return 1;
    }
    return 0;
}

int main()
{
    int n;
    cin >> n;
    for(int i = 0;i < n;i++)
        cin >> koy[i];
    for(int i = 0;i < n;i++)
        cin >> kar[i];
    int cnt = 0;
    sort(koy,koy + n);
    sort(kar,kar + n);
    for(int i = 0;i < n;i++){
        for(int j = 0;j < n;j++){
            int t = koy[i]^kar[j];
      //      cout << t <<endl;
            if(BinarySea(koy,n,t)){
                cnt++; break;
            }

            if(BinarySea(kar,n,t))
                cnt++;
        }
    }
   // cout << cnt << endl;
    if(cnt%2 == 0) cout << "Karen\n";
    else cout << "Koyomi\n";

   /* while(1){
        int a,b;
        cin >> a >> b;
        int c = a^b;

    }*/

    return 0;
}

#include <iostream>
using namespace std;

int main()
{
    int n,np=0;
    cin >> n;
    int a[n+1],b[n+1];
    for(int i=1;i<n+1;i++)
        cin >> a[i];
    for(int i=1;i<n+1;i++)
        cin >> b[i];
    for(int i=1;i<n+1;i++)
    {
        for(int j=i;j<n+1;j++)
        {
            if((a[i] xor b[j])<=2*n && (a[i] xor b[j])>0)
            {
                np+=(i==j)?1:2;
            }

        }
    }
    if(np%2 == 0)
        cout <<  "Karen" << endl;
    else
        cout <<  "Koyomi" << endl;

}

#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
ll mod=1e9+7;

ll ceil1(ll n,ll k){
	if(n%k) return n/k+1;
	return n/k;
}

ll pow1(ll n,ll k,ll modu){
		ll ans=1;
		while(k!=0){
			if(k%2) ans=(ans*n)%modu;
			n=(n*n)%modu;
			k=k/2;
		}
		return ans%modu;
}

bool ispal(string s){
	ll i=0;
	ll j=s.size()-1;
	while(i<j){
		if(s[i]!=s[j]) return false;
		i++;
		j--;
	}
	return true;
}

ll gcdd(ll a,ll b){
	if(b==0) return a;
	return gcdd(b,a%b);
}

ll fact(ll n){
	if(n==1 || n==0) return 1;
	else return (n*fact(n-1));
}

bool isprime(ll n)
{
    if (n <= 1)
        return false;
    if (n <= 3)
        return true;

    if (n % 2 == 0 || n % 3 == 0)
        return false;

    for (ll i = 5; i * i <= n; i = i + 6)
        if (n % i == 0 || n % (i + 2) == 0)
            return false;

    return true;
}

void solve(){
	ll n,ans=0;
	cin>>n;
	vector<ll> a(n),b(n);
	map<ll,ll> m;
	for(ll i=0;i<n;i++) {cin>>a[i]; m[a[i]]++; }
	for(ll i=0;i<n;i++) {cin>>b[i]; m[b[i]]++; }
	for(ll i=0;i<n;i++){
		for(ll j=0;j<n;j++){
			ll x=(a[i]^b[j]);
			if(m[x]!=0){
				if(i!=j) ans++;
				ans++;
			}
		}
	}
	if(ans%2) cout<<"Koyomi"<<endl;
	else cout<<"Karen"<<endl;
	return;
}

int main(){
	  ios_base::sync_with_stdio(false);
      cin.tie(0);
      cout.tie(0);
	  ll q=1;
	  //cin>>q;
	  while(q--){
		solve();
	  }
	  return 0;
}

#include <cstdio>
#include <iostream>

using namespace std;

const int MAXN = 2000 + 3;
const int MAXX = 2e6 + 3;

int main()
{

    int n;
    scanf("%d", &n);

    int doesExist[MAXX] ;
    int xx[MAXN], yy[MAXN];

    for(int i = 0; i < n; ++i) {
        scanf("%d", xx+i);
        doesExist[xx[i]] = 1;
    }

    for(int i = 0; i < n; ++i) {
        scanf("%d", yy+i);
        doesExist[yy[i]] = 1;
    }

    int cnt = 0;

    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < n; ++j) {
            int r = xx[i] ^ yy[j];
            if(0 <= r && r < MAXX && doesExist[r])
                ++cnt;
        }
    }

    if (cnt % 2 == 0) {
       cout << "Karen";}
    else {
         cout << "Koyomi";
    }

    return 0;
}

#include <bits/stdc++.h>
#define int long long
#define br cout << '\n'

using namespace std;

const int MOD = 1e9 + 7;

void printv(vector<int> arr, int n){for(int i = 0; i < n; ++i) cout << arr[i] <<" ";cout<<endl;}
void print(int arr[], int n){for(int i = 0; i < n; ++i) cout << arr[i] <<" ";cout<<endl;}
bool isPrime(int n){bool flag = 1;for(int i = 2; i <= sqrt(n); ++i){if(n % i == 0){flag = 0;break;}}return (flag ? 1 : 0);}
int mod_power(int x, int y){int res = 1;while(y){if(y & 1) res = (res * x) % MOD;x = (x * x) % MOD;y >>= 1;}return res;}

signed main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);

   int n;
   cin >> n;
   vector<int> a(n), b(n);
   map<int, int> m;
   for(int i = 0; i < n; ++i){
      cin >> a[i];
      m[a[i]] = 1;
   }
   for(int i = 0; i < n; ++i){
      cin >> b[i];
      m[b[i]] = 1;
   }
   int cnt = 0;
   for(int i = 0; i < 50; ++i){
      for(int j = 0; j < n; ++j){
         int v = (1ll << i);
         int x = a[j] + v -  2ll * (a[j] & v);
         cnt += (m[x] == 1);
      }
   }
   if(cnt % 2 == 0){
      puts("Karen");
   }
   else{
      puts("Koyomi");
   }

   return 0;
}

#include <algorithm>
#include <iostream>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cstdio>
#include <string>
#include <vector>
#include <cmath>
#include <ctime>
#include <queue>
#include <stack>
#include <map>
#include <set>

using namespace std;

#define foreach(i,x) for(type(x)i=x.begin();i!=x.end();i++)
#define FOR(ii,aa,bb) for(int ii=aa;ii<=bb;ii++)
#define ROF(ii,aa,bb) for(int ii=aa;ii>=bb;ii--)

#define dbgs(x) cerr << (#x) << " --> " << (x) << ' '
#define dbg(x) cerr << (#x) << " --> " << (x) << endl

#define type(x) __typeof(x.begin())

#define mid (bas + son >> 1)
#define right (k + k + 1)
#define left (k + k)

#define pb push_back
#define mp make_pair

#define nd second
#define st first

#define SET(A,b) memset(A,b,sizeof (A) )

#define mod 1000000007
#define inf mod

#define endl '\n'
#define endll puts("")

#define N 2000005

typedef pair < int , int > pii;

typedef long long ll;
int n, a[N], b[N], h[N], ans = 0;

int main () {
	cin >> n;
	FOR(i, 1, n){
		cin >> a[i];
		h[a[i]]++;
	}
	FOR(i, 1, n){
		cin >> b[i];
		h[b[i]]++;
	}
	FOR(i, 1, n){
		FOR(j, 1, n){
			if(h[a[i] ^ b[i]])
				ans++;
		}
	}
	if(ans%2)
		puts("Koyomi");
	else
		puts("Karen");
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

#define inf 1000000000
#define ii pair<int, int>
#define vi vector<int>
#define vii vector< vector<int> >

int main()
{
//    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
    int n;
    scanf("%d", &n);
    int x[n], y[n];
    bool vis[2 * 1000000 + 10];
    memset(vis, 0, sizeof vis);
    for(int i=0; i<n ;i++){
        scanf("%d", &x[i]);
        vis[x[i]] = 1;
    }

    for(int i=0; i<n ; i++){
        scanf("%d", &y[i]);
        vis[y[i]] = 1;
    }
    int cnt = 0;
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++)
            if(vis[x[i] ^ y[j]])
                cnt++;
    }
    if(cnt%2) printf("Koyomi");
    else printf("Karen");
}

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <algorithm>
using namespace std;

const int MAXN = 2e3 + 5;

int A[MAXN + 5], B[MAXN + 5];
bool vis[MAXN * MAXN + 5];

int N;
int main()
{
	scanf("%d", &N);
	for(int i = 1; i <= N; i++) scanf("%d", &A[i]), vis[A[i]] = true;
	for(int i = 1; i <= N; i++) scanf("%d", &B[i]), vis[B[i]] = true;
	int sum = 0;
	for(int i = 1; i <= N; i++){
		for(int j = 1; j <= N; j++){
			int x = A[i] ^ B[i];
			if(x <= MAXN * MAXN && vis[x]) sum++;
		}
	}
	if(sum & 1) printf("Koyomi\n");
	else printf("Karen\n");
}

#include<iostream>
#include<vector>
#include<set>
using namespace std;

int main()
{
  int n,t=0;
  cin>>n;
  vector<int> a(n+1),b(n+1);
   set<int> ss;
  for (int i=1; i<=n; i++)
  {
      cin>>a[i];
         ss.insert(a[i]);
  }
     for (int i=1; i<=n; i++)
  {
      cin>>b[i];
        ss.insert(b[i]);
  }

      for (int i=1; i<=n; i++)
     for (int j=i; j<=n; j++)
  {     if(i==j) {if (ss.count(a[i]^b[j])) t++;}
     else
         if (ss.count(a[i]^b[j])) t+=2;
  }
    if (t%2==0)
    cout<<"Karen";
    else  cout<<"Koyomi";

}

#include<iostream>
#include<cstdio>
using namespace std;
const int N=2e6+5;

int a[N],b[N];
int main(){
	int n;
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&a[i]);
	}
	for(int i=1;i<=n;i++){
		scanf("%d",&b[i]);
	}
	int ans=0;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			int t=a[i]^b[i];
			if(t<=n)
				ans++;
		}
	}
	if(ans%2)
		puts("Koyomi");
	else
		puts("Karen");
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
int a[2005], b[2005];
main() {
	int n;
	long long dem=0;
	cin>>n;
	for (int i=1; i<=n; i++){
		cin>>a[i];
	}
	for (int i=1; i<=n; i++){
		cin>>b[i];
	}
	for (int i=1; i<=n; i++){
		for (int j=1; j<=n; j++){
			int t=a[i]^b[j];
			if (t>=1 && t<=2*n) dem++;
		}
	}
	//cout<<dem<<endl;
	if (dem%2==0) cout<<"Karen";
	else cout<<"Koyomi";
}

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <algorithm>
#include <set>
#include <functional>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const LL INF = 1e18;
const int MAXN = 10007;
const int MOD = 30021;
const double eps = 1e-8;
const double PI = acos(-1.0);
map<int, int>flag;
int x[2005];
int y[2005];
int n;
int ans;
int main()
{
	ans = 0;
	flag.clear();
	scanf("%d", &n);
	for (int i = 1; i <= n; i++)
	{
		scanf("%d", &x[i]);
		flag[x[i]] = 1;
	}
	for (int i = 1; i <= n; i++)
	{
		scanf("%d", &y[i]);
		flag[x[i]] = 1;
	}
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			if (flag[x[i] ^ y[i]])
				ans++;
		}
	}
	if (ans % 2 == 0)
		printf("Karen\n");
	else
		printf("Koyomi\n");
}

#include<bits/stdc++.h>
using namespace std;
#define ll  long long
#define inf 999999999999999999
#define fr(a,n) for(ll i=a;i<=n;i++)
#define sc2(x,y) scanf("%lld%lld",&x,&y);
#define sc1(x)  scanf("%lld",&x);
#define prll2(x,Y) prllf("%lld %lld",x,y);
#define prll1(x) prllf("%lld",x);
#define fd(i,a,b)   for(long long i=b;i>=a;i--)
#define clr(x)      memset(x,0,sizeof(x))
#define cln(x)      memset(x,-1,sizeof(x))
#define __          prllf(" ")
#define _           prllf("\n")
#define read()      freopen("in.txt","r",stdin)
#define write()     freopen("out.txt","w",stdout)
bool arr[20000010];
ll arr1[2010],arr2[2010];
int main()
{
    ll n;

    while(cin>>n)
    {

        for(ll i=0;i<=2000005;i++)
            arr[i]=false;
        ll arr1[2100],arr2[2100];

        for(ll i=0;i<n;i++){
            scanf("%d",&arr1[i]);
            arr[arr1[i]]=true;

        }
        for(ll i=0;i<n;i++){
            scanf("%d",&arr2[i]);
            arr[arr2[i]]=true;

        }

        ll cnt=0;
        for(ll i=0;i<n;i++)
        {
            for(ll j=0;j<n;j++)
            {
                ll x=arr1[i]^arr2[j];
                if(x>2000000)
                    continue;
                    if(arr[x]==true)
                        cnt++;
            }
        }
        //cout<<cnt<<endl;
        if(cnt%2==0)
            cout<<"Karen"<<endl;
        else
        cout<<"Koyomi"<<endl;
    }
}

#include        <bits/stdc++.h>
#define ll      long long int
#define pb      push_back
#define mp      make_pair
#define F       first
#define S       second
#define MOD     1000000007
#define pii     pair<int,int>
#define vi      vector<int>
#define fio     ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define N       2000010
#define M       21
using namespace std;

int m[N];
int a[2010],b[2010];

int main() {
    fio;
    memset(m,0,sizeof m);
    int n;
    cin>>n;
    for(int i=0; i<n; i++){
        cin>>a[i];
        m[a[i]]++;
    }
    for(int i=0; i<n; i++){
        cin>>b[i];
        m[b[i]]++;
    }
    int ans=0;
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){

            if(a[i]^b[i]<N&&m[a[i]^b[j]]>0)ans++;
        }
    }
    if(ans&1){
        cout<<"Koyomi";
    }
    else{
        cout<<"Karen";
    }
    return 0;
}

#include <iostream>
using namespace std;
// A recursive binary search function. It returns location of x in
// given array arr[l..r] is present, otherwise -1
int binarySearch(int arr[], int l, int r, int x)
{
   if (r >= l)
   {
        int mid = l + (r - l)/2;

        // If the element is present at the middle itself
        if (arr[mid] == x)  return mid;

        // If element is smaller than mid, then it can only be present
        // in left subarray
        if (arr[mid] > x) return binarySearch(arr, l, mid-1, x);

        // Else the element can only be present in right subarray
        return binarySearch(arr, mid+1, r, x);
   }

   // We reach here when element is not present in array
   return -1;
}
int main()
{
    int n,np=0;
    cin >> n;
    int a[n+1],b[n+1];
    for(int i=1;i<n+1;i++)
        cin >> a[i];
    for(int i=1;i<n+1;i++)
        cin >> b[i];
    for(int i=1;i<n+1;i++)
    {
        for(int j=1;j<n+1;j++)
        {
          int r= a[i] xor b[j];
          if(binarySearch(a,1,n+1,r) || binarySearch(b,1,n+1,r))
                np++;
        }
    }
    if(np%2 == 0)
        cout <<  "Karen" << endl;
    else
        cout <<  "Koyomi" << endl;

}

#include <iostream>
using namespace std;

int main() {
	// your code goes here
	int n;
	cin>>n;
	int a[n];
	int b[n];
	int hash[2000001]={0};
	for(int i=0;i<n;i++){
		cin>>a[i];
		hash[a[i]]++;
	}
	for(int i=0;i<n;i++){
		cin>>b[i];
		hash[b[i]]++;
	}int co=0;
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){int index=a[i]^b[j];
			//if(hash[a[i]^b[j]]>0) co++;
			if(index<=2000000 && index>=1) {
				if(hash[index]>0) co++;
			}
		}
	}
	co=co*2;
	if(co!=0 && co%2==0) cout<<"Karen"<<endl;
	else cout<<"Koyomi"<<endl;
	return 0;
}

#include <stdio.h>
#include <math.h>
int main()
{
	long long a, b;
	scanf("%I64d%I64d", &a, &b);
	long long S, X;
	S = 1;
	for (long long i = a+1 ; i <= b; i++)
	{
		X = i%10;
		if (X != 0)
		S *= X;
		else
		{S=0;break;}
	}
	S %= 10;
	printf("%I64d\n", S);
	return 0;
}

#include <iostream>
#include<vector>
#include<algorithm>
using namespace std;

int rechercheDich(vector<long long> v, long long elt)
{
     int middle=0, low=0, high=v.size()-1;

      while(low<=high)
		   {
			   middle=(low+high)/2;

			   if(v.at(middle)>elt){
				   high=middle -1;

			   }
			   else if(v.at(middle)==elt){

				   return 0;
				   }
			   else{
				   low=middle +1;

			   }
			  // System.out.println("nb="+nb);
		   }
		   return -1;

}
int main()
{
    int n, nbpairs;
    long long x,y;
    vector<long long> xi, yj;
    cin>>n;
    for(int i=0;i<n;i++)
    {
       cin>>x>>y;
        xi.push_back(x);
        yj.push_back(y);
    }
    nbpairs=0;
      for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
        if ((rechercheDich(xi,xi[i]^yj[j])==0)|| (rechercheDich(yj,xi[i]^yj[j])==0))
            nbpairs++;

    if(nbpairs%2==0)
        cout<< "Karen";
    else
        cout<<"Koyomi";
    return 0;
}

#include <iostream>
#include <vector>
#include <set>
#include <unordered_map>
#include <list>
#include <cmath>
#include <algorithm>
#include <queue>
#include <climits>
#include <iomanip>
#include <map>
#include <numeric>
//#include "bits/stdc++.h"

using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> karen(n);
    vector<int> koyomi(n);
    for (int i = 0; i < n; i++) {
        cin >> karen[i];
    }
    for (int i = 0; i < n; i++) {
        cin >> koyomi[i];
    }
    if (n & 1 == 1) {
        cout << "Karen" << endl;
    } else {
        cout << "Koyomi" <<endl;
    }
    return 0;
    int a = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            a ^= karen[i] ^ koyomi[j];
        }
    }
}

#include <bits/stdc++.h>
using namespace std;

int main() {
	// your code goes here
	int n,i,j;
	int cnt=0;
	cin >> n;
	set<int> a;
	int x[n+8],y[n+8];
	for(i=0;i<n;i++){
		cin>>x[i];
		a.insert(x[i]);
			}
	for(i=0;i<n;i++){
		cin>>y[i];
		a.insert(y[i]);
	}
	for(i=0;i<n;i++){
		for(j=0;j<n;j++){
			int val = x[i]^y[j];
			//cout<<INT_MAX<<endl;
			int flag=1;
			set<int>::iterator it =lower_bound (a.begin(), a.end(), val);
			if(it == a.end()){
				flag=0;
			}
			if(flag == 1){
				cnt++;
				cnt=cnt%2;
			}
		}
	}
	if (cnt%2==0)
		cout<<"Karen"<<endl;
	else
		cout<<"Koyomi"<<endl;
	return 0;
}

#include<bits/stdc++.h>
using namespace std;

bool x[2097155],y[2097155];

int main(){
	cin.tie(0);
	cout.tie(0);
	int n;
	long coun=0;
	long a[2005],b[2005];
	cin>>n;
	memset(a,0,sizeof(a));
	memset(b,0,sizeof(b));
	memset(x,false,sizeof(x));
	memset(y,false,sizeof(y));
	for(int i=1;i<=n;i++){
		cin>>a[i];
		x[a[i]]=true;
	}
	for(int i=1;i<=n;i++){
		cin>>b[i];
		x[b[i]]=true;
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			if(x[a[i]^b[i]]){
				coun++;
			}
		}
	}
	if(coun%2==0)
		cout<<"Karen\n";
	else
		cout<<"Koyomi\n";
	return 0;
}

#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <sstream>
#include <algorithm>
using namespace std;

vector<int> karen, koyemi;
vector < int> used;

int main()
{

	int n=3;
	cin >> n; int tmp;
	for (int i = 0; i < n; i++)
	{
		cin >> tmp;
		koyemi.push_back(tmp);
		used.push_back(tmp);
	}
	for (int i = 0; i < n; i++)
	{
		cin >> tmp;
		karen.push_back(tmp);

		used.push_back(tmp);
	}
	int counter = 0;
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			int val = koyemi[i] ^ karen[j];
			if (val < 2*n && lower_bound(used.begin(),used.end(), val)!=used.end())
			{
				counter++;
			}
		}
	}
	if (counter % 2 == 0)cout << "Karen";
	else cout << "Koyomi";
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long a,b,c,d,e,i,j,k;
    cin>>a;
    set<long long>st;
    vector<long long>s,v,t;
    for(i=0;i<a;i++){
        cin>>b;
         v.push_back(b);
        t.push_back(b);
    }
    for(j=0;j<a;j++){
        cin>>c;
        v.push_back(c);
        s.push_back(c);
    }

    long long count=0;
    for(i=0;i<a;i++){
            for(j=0;j<2*a;j++){
         if((s[i] xor t[i])==v[j]){
            count++;
            break;
        }
    }
    }
    if(count%2==0)
        cout<<"Karen"<<endl;
    else cout<<"Koyomi"<<endl;
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
const int maxn = 2050;
const int N = 5e6+1000;
int x[maxn],y[maxn];
bool ex [N];
int n;
int main(){
	scanf("%d",&n);
	for (int i=0;i<n;i++){
		scanf("%d",x+i);
		ex[x[i]] =true;
	}
	for (int i=0;i<n;i++){
		scanf("%d",y+i);
		ex[y[i]] =true;
	}
	int cnt=0;
	for (int i=0;i<n;i++){
		for (int j=0;j<n;j++){
			if (x[i]^y[j]<N&&ex[x[i]^y[j]]){
				cnt++;
			}
		}
	}
	if (!(cnt&1)){
		printf("Karen\n");
	}else{
		printf("Koyomi\n");
	}
	return 0;
}

#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
using namespace std;
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define FORD(i,a,b) for(int i=(a);i>=(b);i--)
inline bool EQ(double a, double b) { return fabs(a-b) < 1e-9; }
const int INF = 1<<29;
typedef long long ll;
typedef vector<int> vi;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef vector<ii> vii;
inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return (n>>b)&1; }
inline void set_bit(int & n, int b) { n |= two(b); }
inline void unset_bit(int & n, int b) { n &= ~two(b); }
inline int last_bit(int n) { return n & (-n); }
inline int ones(int n) { int res = 0; while(n && ++res) n-=n&(-n); return res; }
template<class T> void chmax(T & a, const T & b) { a = max(a, b); }
template<class T> void chmin(T & a, const T & b) { a = min(a, b); }
/////////////////////////////////////////////////////////////////////
int main()
{
    vector<ll> A,B,C;
    ll n, a, i, j, cnt = 0;
    cin >> n;
    REP(i,n)
    {
        cin >> a;
        A.push_back(a);
        C.push_back(a);
    }
    REP(i,n)
    {
        cin >> a;
        B.push_back(a);
        C.push_back(a);
    }
    sort(C.begin(), C.end());
    REP(i,n)
    {
        REP(j,n)
        {
            if (binary_search(C.begin(),C.end(),A[i] ^ B[i]))
            cnt = (cnt + 1) % 2;
        }
    }
    if (cnt == 0)
    cout << "Karen" << endl;
    else cout << "Koyomi" << endl;
    return 0;
}

#include<iostream>
#include<map>
#define ll long long
#define inf 5e18
#define fl(n) for(int i = 0; i < n;i++)
using namespace std;
int main() {
	map<ll,ll> a;
	int x[2000], y[2000], n;
	cin >> n;
	fl(n) {
		cin >> x[i];
		a[x[i]]++;
	}
	fl(n) {
		cin >> y[i];
		a[y[i]]++;
	}
	int res = 0;
	fl(n) {
		for (int j = 0; j < n; j++) {
			if (a[x[i]^y[i]] > 0)
				res++;
		}
	}
	cout << (res % 2 ? "Koyomi\n" : "Karen\n");
}

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <set>
#include <string>

using namespace std;
int x[2010],y[2010];
int main() {
    int n;
    set<int> s;
    s.clear();
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&x[i]);
        s.insert(x[i]);
    }
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&y[i]);
        s.insert(y[i]);
    }
    int ans = 0;
    for(int i=1;i<=n;i++)
    {
        if(s.find(x[i]^y[i])!=s.end())
            ans++;
    }
    if(ans%2 == 0)
        cout << "Karen" << endl;
    else
        cout << "Koyomi" << endl;
	return 0;
}

#include <bits/stdc++.h>
#define st first
#define nd second

using namespace std;
typedef long long LL;
typedef pair <int, int> pr;

const int mx = 2e6 + 10;
const int md = 1e9 + 7;

int n, a[mx], b[mx], cnt = 0, p[mx] = {0};

int main() {
      //freopen("v.txt", "r", stdin);
      //freopen("", "w", stdout);
      //ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

      cin >> n;
      for (int i = 1; i <= n; i ++) cin >> a[i], p[a[i]] ++;
      for (int i = 1; i <= n; i ++) cin >> b[i], p[b[i]] ++;

      for (int i = 1; i <= n; i ++)
            for (int j = 1; j <= n; j ++) if (p[a[i] ^ b[j]]) cnt ++;

      if (cnt % 2) cout << "Koyomi";
      else cout << "Karen";

      return 0;
}

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int N;
int x[2010],y[2010];
bool c[2000010];
int main(){
	scanf("%d",&N);
	for(int i=1;i<=N;i++){
		scanf("%d",&x[i]);
		c[x[i]]=true;
	}
	for(int i=1;i<=N;i++){
		scanf("%d",&y[i]);
		c[y[i]]=true;
	}
	int cnt=0;
	for(int i=1;i<=N;i++)
		for(int j=1;j<=N;j++)
			if((x[i]^y[i])<2000000&&c[x[i]^y[i]])
				cnt++;
	if(cnt%2) printf("Koyomi");
	else printf("Karen");
	return 0;
}

#include <bits/stdc++.h>
#include <vector>
#include <iterator>
#define ll long long
using namespace std;

int main(){
	ll n,cnt=0;
	cin>>n;
	vector<ll> arr;
	for(int i=0;i<n*2;i++){
		ll x;
		cin>>x;
		arr.push_back(x);
	}
	for(int i=0;i<n*2;i++){
		for(int j=i+1;j<n*2;j++){
			ll yi=arr[i]^arr[j];
			bool found=false;
			for(int k=0;k<n*2;k++){
				if(arr[k]==yi){
					//cout<<"dey are "<<arr[i]<<", "<<arr[j]<<endl;
					found=true;
					cnt++;
					break;
				}
			}
		}
	}
	//cout<<"Cnt is "<<cnt<<endl;
	if(cnt%2==0) cout<<"Karen";
	else cout<<"Koyomi";
	return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
#define M 4000005
using namespace std;
bool a[M],b[M];
int main()
{
    int n;
    int A[2005],B[2005];
    scanf("%d",&n);

    memset(a,false,sizeof(a));
    memset(b,false,sizeof(b));

    int x;

    for(int i=1;i<=n;i++)
    {
        scanf("%d",&A[i]);
        a[A[i]]=true;
    }
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&B[i]);
        b[B[i]]=true;
    }

    int num=0;

    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            x=A[i]^B[j];
            cout<<x<<" "<<i<<" "<<j<<endl;
            if(a[x]==true || b[x]==true)
                num++;
        }
    }
    //cout<<num;
    if(num%2==0)
        cout<<"Karen";
    else
        cout<<"Koyomi";
}

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define fl float
#define pi 3.141592654
#define vct vector<string>
#define itm map<string,ll>::iterator
#define fr(i,n) for(i=0;i<n;i++)
#define fr(i,k) for(i=0;i<k;i++)
#define fr(i,m) for(i=0;i<m;i++)
#define snd second
#define fst first
#define pb push_back
#define iso ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
ll n,i,j,k,l,m,arr[200010],x,a,b,c,d,arr1[200010],p,hi,lo,mid,s,y,t;
map<ll,ll> mp,mp1;
vct vc,vc1;
string st,st1,st2,stx,sty;
int main()
{iso
    cin>>n;
    for(i=0;i<n;i++){
        cin>>arr[i];mp[arr[i]]=1;
    }
    for(i=0;i<n;i++){cin>>arr1[i];mp[arr1[i]]=1;}s=0;
    for(i=0;i<n;i++){
        for(j=0;j<n;j++){
            if(mp.count(arr[i]^arr1[j])!=mp.empty())s++;
        }
    }if(s%2==0)cout<<"karen";
    else cout<<"kayomi";
//    m=-999;//cout<<n;
//    for(i=0; i<n; i++)
//    {
//        cin>>a;
//        st.clear();
//        while(a>0)
//        {
//            st+=((a%2)+'0');
//            a/=2;
//        }
//        p=st.size();//cout<<st<<' ';
//        m=max(p,m);reverse(st.begin(),st.end());
//        vc.pb(st);
//        mp[st]=1;
//    }//cout<<endl;
//    for(i=0; i<n; i++)
//    {
//        cin>>a;
//        st.clear();
//        while(a>0)
//        {
//            st+=((a%2)+'0');
//            a/=2;
//        }
//        p=st.size();//cout<<st<<' ';
//        m=max(p,m);reverse(st.begin(),st.end());
//        vc1.pb(st);
//        mp[st]=1;
//    }
//    for(i=0; i<vc.size(); i++)
//    {
//        if(vc[i].size()<m)
//        {
//            stx.clear();
//            for(j=vc[i].size(); j<m; j++)
//                stx+='0';
//            stx+=vc[i];
//            mp.erase(vc[i]);
//            mp[stx]=1;
//            vc[i]=stx;
//        }
//    }
//    for(i=0; i<vc1.size(); i++)
//    {
//        if(vc1[i].size()<m)
//        {
//            stx.clear();
//            for(j=vc1[i].size(); j<m; j++)
//                stx+='0';
//            stx+=vc1[i];
//            mp.erase(vc1[i]);
//            mp[stx]=1;
//            vc1[i]=stx;
//        }
//    }
//    s=0;
//    for(i=0; i<n; i++)
//    {
//       // cout<<vc[i]<<' ';
//        for(j=0; j<n; j++)
//        {
//            stx.clear();
//                for(k=0;k<vc[i].size();k++){
//                    if(vc[i][k]==vc1[j][k])stx+='0';
//                    else stx+='1';
//                }
//                if(mp.count(stx)!=mp.empty())s++;
//         //   cout<<vc1[i]<<' ';
//
//        }
//        //cout<<endl;
//    }
//    if(s%2==0)cout<<"Karen";
//    else cout<<"Koyomi";
}