Rock... Paper!

After Karen have found the deterministic winning (losing?) strategy for rock-paper-scissors, her brother, Koyomi, comes up with a new game as a substitute. The game works as follows.

A positive integer *n* is decided first. Both Koyomi and Karen independently choose *n* distinct positive integers, denoted by *x*<sub class="lower-index">1</sub>, *x*<sub class="lower-index">2</sub>, ..., *x*<sub class="lower-index">*n*</sub> and *y*<sub class="lower-index">1</sub>, *y*<sub class="lower-index">2</sub>, ..., *y*<sub class="lower-index">*n*</sub> respectively. They reveal their sequences, and repeat until all of 2*n* integers become distinct, which is the only final state to be kept and considered.

Then they count the number of ordered pairs (*i*, *j*) (1 ≤ *i*, *j* ≤ *n*) such that the value *x*<sub class="lower-index">*i*</sub> xor *y*<sub class="lower-index">*j*</sub> equals to one of the 2*n* integers. Here xor means the [bitwise exclusive or](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) operation on two integers, and is denoted by operators ^ and/or xor in most programming languages.

Karen claims a win if the number of such pairs is even, and Koyomi does otherwise. And you're here to help determine the winner of their latest game.
The first line of input contains a positive integer *n* (1 ≤ *n* ≤ 2 000) — the length of both sequences.

The second line contains *n* space-separated integers *x*<sub class="lower-index">1</sub>, *x*<sub class="lower-index">2</sub>, ..., *x*<sub class="lower-index">*n*</sub> (1 ≤ *x*<sub class="lower-index">*i*</sub> ≤ 2·10<sup class="upper-index">6</sup>) — the integers finally chosen by Koyomi.

The third line contains *n* space-separated integers *y*<sub class="lower-index">1</sub>, *y*<sub class="lower-index">2</sub>, ..., *y*<sub class="lower-index">*n*</sub> (1 ≤ *y*<sub class="lower-index">*i*</sub> ≤ 2·10<sup class="upper-index">6</sup>) — the integers finally chosen by Karen.

Input guarantees that the given 2*n* integers are pairwise distinct, that is, no pair (*i*, *j*) (1 ≤ *i*, *j* ≤ *n*) exists such that one of the following holds: *x*<sub class="lower-index">*i*</sub> = *y*<sub class="lower-index">*j*</sub>; *i* ≠ *j* and *x*<sub class="lower-index">*i*</sub> = *x*<sub class="lower-index">*j*</sub>; *i* ≠ *j* and *y*<sub class="lower-index">*i*</sub> = *y*<sub class="lower-index">*j*</sub>.
In the first example, there are 6 pairs satisfying the constraint: (1, 1), (1, 2), (2, 1), (2, 3), (3, 2) and (3, 3). Thus, Karen wins since 6 is an even number.

In the second example, there are 16 such pairs, and Karen wins again.
3
1 2 3
4 5 6
Karen
5
2 4 6 8 10
9 7 5 3 1
Karen
1
1
2000000
Karen
2
97153 2000000
1999998 254
Karen
15
31 30 29 28 27 26 25 24 23 22 21 20 19 18 17
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Karen
30
79656 68607 871714 1858841 237684 1177337 532141 161161 1111201 527235 323345 1979059 665353 507265 1290761 610606 1238375 743262 106355 1167830 180315 1233029 816465 752968 782570 1499881 1328457 1867240 13948 1302782
322597 1868510 1958236 1348157 765908 1023636 874300 537124 631783 414906 886318 1931572 1381013 992451 1305644 1525745 716087 83173 303248 1572710 43084 333341 992413 267806 70390 644521 1014900 497068 178940 1920268
Karen
30
1143673 436496 1214486 1315862 148404 724601 1430740 1433008 1654610 1635673 614673 1713408 1270999 1697 1463796 50027 525482 1659078 688200 842647 518551 877506 1017082 1807856 3280 759698 1208220 470180 829800 1960886
1312613 1965095 967255 1289012 1950383 582960 856825 49684 808824 319418 1968270 190821 344545 211332 1219388 1773751 1876402 132626 541448 1584672 24276 1053225 1823073 1858232 1209173 1035991 1956373 1237148 1973608 848873
Karen
1
2
3
Karen
1
1048576
1020000
Karen
3
9 33 69
71 74 100
Karen
3
1 2 3
9 5 6
Karen
3
1 7 8
9 10 20
Karen
3
1 3 2
4 5 8
Karen
3
2 1 100
3 4 9
Karen
3
3 1 100
2 1000 100000
Karen
3
1 2 5
3 4 6
Karen
3
3 1 8
2 4 17
Karen
3
1 5 6
7 8 3
Karen
1
1
3
Karen
3
1 3 10
2 4 20
Karen
3
7 8 10
15 9 11
Karen
3
5 6 8
3 100 9
Karen
3
1 2 3
4 5 8
Karen
3
1 2 19
3 7 30
Karen
3
1 2 3
6 7 8
Karen
3
1 4 55
2 3 9
Karen
3
1 100 200
5 4 500
Karen
1
6
7
Karen
3
1 3 5
2 4 13
Karen
3
3 1 100
2 1000 10000
Karen
3
1 3 9
2 4 40
Karen
2
1 199999
1935807 2000000
Karen
3
1 3 8
2 4 24
Karen
2
4 1
7 3
Karen
3
1 2 4
3 7 8
Karen
3
1 6 10000
2 3 100000
Karen
n=int(input())
T=[]
T1=[]
T2=[]
for i in range(n):
    x=int(input())
    T1.append(x)
for i in range(n):
    x=int(input())
    T2.append(x)
for i in range(n):
    T.append(T1[i])
for i in range(n):
    T.append(T2[i])
c=0    
for i in range(n):
    for j in range(n):
        x=T1[i]^T2[j]
        if(T.count(x)==1):
            c=c+1
if(c%2==0):
    print("Karen")
else:
    print("Koyomi")