#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  map<long long int, int> m;
  long long int a[n];
  long long int b[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    if (m.find(a[i]) == m.end()) {
      m[a[i]] = 1;
    }
  }
  for (int i = 0; i < n; i++) {
    cin >> b[i];
    if (m.find(b[i]) == m.end()) {
      m[b[i]] = 1;
    }
  }
  long long int count = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      long long int t = a[i] ^ b[j];
      if (m.find(t) != m.end()) {
        count++;
      }
    }
  }
  if (count % 2 == 0) {
    cout << "Karen\n";
  } else {
    cout << "Koyomi\n";
  }
}
