#include <bits/stdc++.h>
using namespace std;
const int maxn = 2005, inf = 0x3f3f3f3f;
const long long llinf = 0x3f3f3f3f3f3f3f3f;
const long double pi = acos(-1.0L);
int a[maxn], b[maxn];
int main() {
  unordered_map<int, int> mp;
  int n, i, j, cnt = 0;
  scanf("%d", &n);
  for (i = 1; i <= n; i++) scanf("%d", &a[i]), mp[a[i]] = 1;
  for (i = 1; i <= n; i++) scanf("%d", &b[i]), mp[b[i]] = 1;
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= n; j++) {
      if (mp[a[i] ^ b[j]]) cnt++;
    }
  }
  if (cnt % 2 == 0)
    cout << "Karen";
  else
    cout << "Koyomi";
  return 0;
}
