CF869A 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 choose $ n $ distinct positive integers, denoted by $ x_{1},x_{2},...,x_{n} $ and $ y_{1},y_{2},...,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

The first line of input contains a positive integer $ n $ ( $ 1

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

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.