#include <bits/stdc++.h>
using namespace std;
long long a[5000001] = {}, a1[5000001] = {}, sum[5000001] = {};
bool prime[5000001] = {};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n;
  cin >> n;
  map<long long, bool> mp;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    mp[a[i]] = true;
  }
  for (int i = 0; i < n; i++) {
    cin >> a1[i];
    mp[a1[i]] = true;
  }
  int ct = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      long long r = a[i] ^ a1[j];
      if (mp.find(r) != mp.end()) {
        ct++;
      }
    }
  }
  if (ct % 2 != 0) {
    cout << "Koyomi\n";
  } else {
    cout << "Karen\n";
  }
  return 0;
}
