#include <bits/stdc++.h>
using namespace std;
const int maxn = 2000 + 100;
int n;
int a[maxn], b[maxn];
set<int> st;
int main() {
  ios::sync_with_stdio(false);
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &a[i]);
    st.insert(a[i]);
  }
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &b[i]);
    st.insert(b[i]);
  }
  int ans = 0;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      int Xor = a[i] ^ b[j];
      if (st.find(Xor) != st.end()) {
        ++ans;
      }
    }
  }
  if (ans % 2 == 0) {
    printf("Karen\n");
  } else {
    printf("Koyomi\n");
  }
  return 0;
}
