#include <bits/stdc++.h>
using namespace std;
const int MAXN = 4000;
int k[4000];
int main() {
  int n;
  cin >> n;
  int a[n];
  int b[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    k[i] = a[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> b[i];
    k[i + n] = b[i];
  }
  sort(k, k + 2 * n);
  bool c = true;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (binary_search(k, k + 2 * n, a[i] ^ b[j])) {
        c != c;
      }
    }
  }
  if (c) {
    cout << "Karen";
  } else {
    cout << "Koyomi";
  }
}
