#include <bits/stdc++.h>
using namespace std;
unordered_map<int, bool> mp;
vector<int> x, y;
int main() {
  int n;
  scanf("%d", &n);
  x.resize(n + 1);
  y.resize(n + 1);
  for (int k = 1; k <= n; k++) {
    scanf("%d", &x[k]);
    mp[x[k]] = true;
  }
  for (int k = 1; k <= n; k++) {
    scanf("%d", &y[k]);
    mp[y[k]] = true;
  }
  int cnt = 0;
  for (int k = 1; k <= n; k++)
    for (int i = 1; i <= n; i++) {
      int t = x[k] ^ y[i];
      if (mp[t]) cnt++;
    }
  if (cnt % 2 == 0)
    printf("Karen");
  else
    printf("Koyomi");
  return 0;
}
