#include <bits/stdc++.h>
using namespace std;
long long modpow(long long a, long long b, long long m) {
  long long c = 1;
  while (b) {
    if (b & 1) c = (c * a) % m;
    b /= 2;
    a = (a * a) % m;
  }
  return c;
}
bool Hash[100000008];
int x[100005], y[100005];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, i, j, c = 0;
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> x[i];
    Hash[x[i]] = 1;
  }
  for (i = 0; i < n; i++) {
    cin >> y[i];
    Hash[y[i]] = 1;
  }
  for (i = 0; i < n; i++)
    for (j = 0; j < n; j++)
      if (Hash[x[i] ^ y[j]]) c++;
  if (c % 2 == 0)
    cout << "Karen\n";
  else
    cout << "Koyomi\n";
  return 0;
}
