#include <bits/stdc++.h>
int comp(const void* a, const void* b) { return (*(int*)a - *(int*)b); }
int main() {
  int n, i, j, r, k, count = 0, x[2010], y[2010], p[4010];
  int* found;
  memset(x, 0, sizeof(x));
  memset(y, 0, sizeof(y));
  memset(p, 0, sizeof(p));
  scanf("%d", &n);
  for (i = 0; i < n; i++) scanf("%d", &x[i]);
  for (i = 0; i < n; i++) scanf("%d", &y[i]);
  for (i = 0; i < n; i++) p[i] = x[i];
  for (i = 0; i < n; i++) p[n + i] = y[i];
  qsort(p, 4010, sizeof(int), comp);
  for (i = 0; i < n; i++)
    for (j = 0; j < n; j++) {
      r = x[i] ^ y[j];
      found = (int*)bsearch(&r, p, 4010, sizeof(int), comp);
      if (found != NULL) count++;
    }
  if (count & 1)
    printf("Koyomi");
  else
    printf("Karen");
  return 0;
}
