#include <bits/stdc++.h>
using namespace std;
int a[5005], b[5005], res;
int main() {
  int n = 0;
  scanf("%d", &n);
  unordered_map<int, bool> num_map;
  for (int i = 1; i <= n; ++i) scanf("%d", a + i), num_map[a[i]] = true;
  for (int i = 1; i <= n; ++i) scanf("%d", b + i), num_map[b[i]] = true;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j)
      if (num_map[a[i] ^ b[j]]) ++res;
  if (res % 2)
    puts("Koyomi");
  else
    puts("Karen");
  return 0;
}
