#include <bits/stdc++.h>
using namespace std;
int A[2006];
int B[2005];
map<int, int> mp;
int main() {
  int a, b, n, x;
  while (cin >> n) {
    mp.clear();
    int t = 1, x1, y1;
    for (int i = 0; i < n; i++) {
      scanf("%d", &A[i]);
      if (mp.count(A[i]) == 0) mp[A[i]] = t++;
    }
    for (int i = 0; i < n; i++) {
      scanf("%d", &B[i]);
      if (mp.count(B[i]) == 0) mp[B[i]] = t++;
    }
    int sum = 0;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
        if (i == j) {
          x = A[i] ^ B[j];
          if (mp.count(x) == 1) sum++;
        } else {
          x = A[i] ^ B[j];
          if (mp.count(x) == 1) sum++;
        }
      }
    }
    if (sum % 2 == 0)
      cout << "Karen" << endl;
    else
      cout << "Koyomi" << endl;
  }
  return 0;
}
