#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, x;
  cin >> n;
  vector<int> A;
  vector<int> B;
  map<int, int> M;
  for (int i = 0; i < n; i++) {
    cin >> x;
    A.push_back(x);
    M[x] = 1;
  }
  for (int i = 0; i < n; i++) {
    cin >> x;
    B.push_back(x);
    M[x] = 1;
  }
  int count = 0;
  int xo;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      xo = (A[i] ^ B[j]);
      if (M.find(xo) != M.end()) count++;
    }
  }
  if (count % 2 == 0)
    cout << "Karen" << endl;
  else
    cout << "Koyomi" << endl;
  return 0;
}
