CF 869 A. The Artful Expedient（异或）

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 choosen distinct positive integers, denoted by x₁, x₂, ..., x_n andy₁, y₂, ..., y_n respectively. They reveal their sequences, and repeat untilall of 2n 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 valuex_ixor y_j equals to one of the2n integers. Here xor means the bitwise exclusive or 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.

Input

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 integersx₁, x₂, ..., x_n (1 ≤ x_i ≤ 2·10⁶) — the integers finally chosen by Koyomi.

The third line contains n space-separated integersy₁, y₂, ..., y_n (1 ≤ y_i ≤ 2·10⁶) — the integers finally chosen by Karen.

Input guarantees that the given 2n integers are pairwise distinct, that is, no pair (i, j) (1 ≤ i, j ≤ n) exists such that one of the following holds:x_i = y_j;i ≠ j and x_i = x_j;i ≠ j and y_i = y_j.

Output

Output one line — the name of the winner, that is, "Koyomi" or "Karen" (without quotes). Please be aware of the capitalization.

Example

Input

3
1 2 3
4 5 6

Output

Karen

Input

5
2 4 6 8 10
9 7 5 3 1

Output

Karen

Note

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.

题意：给出两组数a[]，b[],两组数两两异或，如果存在ai^bj=c，c属于a[]或b[]。满足这样条件的i j有偶数个，则Karen赢。
因为异或的性质 a[i]^b[j]=c则a[i]^c=b[j],b[j]^c=a[i].所以一共有偶数个这样的情况。Karen必赢。