#include <bits/stdc++.h>
using namespace std;
int 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]] = 1;
  }
  for (int i = 0; i < n; ++i) {
    cin >> b[i];
    m[b[i]] = 1;
  }
  int count = 0;
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < n; ++j) {
      int val = a[i] ^ b[j];
      if (m.find(val) != m.end()) count++;
    }
  if (count % 2 == 0)
    cout << "Karen" << endl;
  else
    cout << "Koyomi" << endl;
}
