【CF Round 439 A. The Artful Expedient】

time limit per test 1 second

memory limit per test 256 megabytes

input standard input

output standard output

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₁, x₂, ..., x_nand y₁, y₂, ..., y_n respectively. They reveal their sequences, and repeat until all 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 value x_i xor y_j equals to one of the 2n integers. Herexor 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 integers x₁, x₂, ..., x_n (1 ≤ x_i ≤ 2·10⁶) — the integers finally chosen by Koyomi.

The third line contains n space-separated integers y₁, 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.

Examples

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 6is an even number.

In the second example, there are 16 such pairs, and Karen wins again.

   【翻译】给出两个长度为n的元素内部和之间互不相同数组，从两个数组中各取一个元素形成二元组，如果二元组的元素的异或值存在于数组中，那么就是合法二元组。如果合法二元组个数为偶数，则Karen胜利。反之败。

题解：

    ①暴力解法就是一个Implentation——题目怎么说就怎么做。

    ②正解：根据a^b=c ==> a^c=b 那么合法二元组对数一定是偶数，所以直接输出。

#include<cstdio>
main(){puts("Karen");}//Paul_Guderian

我们都在进行着一场，一场比赛。

不争取就一定会，一定会失败。——————汪峰《英雄》