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 x1, x2, ..., xn and y1, y2, ..., yn 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 xi xor yj equals to one of the 2n 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.

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 x1, x2, ..., xn (1 ≤ xi ≤ 2·106) — the integers finally chosen by Koyomi.

The third line contains n space-separated integers y1, y2, ..., yn (1 ≤ yi ≤ 2·106) — 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: xi = yj; i ≠ j and xi = xj; i ≠ j and yi = yj.

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

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

    		import java.awt.List;
    		import java.io.*;
    		import java.util.*;
     
    		
    		
    		
    		
    		/*
    		 * 
    		 * daiict
    		 *
    		 * 
    		 * 
    		 */
    		
    		
    		public class prac {
    			FastScanner in;
    			PrintWriter out;
    		
    			static ArrayList[] adj;
    			
    			static int n;
    			static int m;
    			
    			static int[] dp1;
    			static int[] dp2;
    			static int color[];
    			static int visited[];
    			static int[][] arr;
    			static int[][] brr;
    			static int[][] ans;
    			static int array[];
    			static int pref[];
    			static int tree[];
    			static int maxval = 32;
    			static HashSet<Integer> set;
    			static int sum = 0;
    		//for dfs do not delete
    			static int dir[][] ={{1,0},{0,1},{0,-1},{-1,0},{1,1},{1,-1},{-1,1},{-1,-1}};
    			
    			static long an = 0;
    			static long bn = 0;
    			static int p = 0;
    			static int ta = -1;
    			static int tb = -1;
    			static Stack<Integer> st;
    			static int k;
    			
    			static long dp[][];
    			
    			static long[] seg;
    			static long count = 0;
    			
    			static class Pair implements Comparable<Pair>
    		    {
    				int x;int y;
    				
    		        Pair(int l, int m) {
    		          
    		        	this.x = l;
    		            this.y = m;
    		          
    		        }
    		        
    		        public int compareTo(Pair p) {
    		            if (this.x == p.x) {
    		                return (int)(this.y-p.y);
    		            }
    		            return (int)(this.x - p.x);
    		        }
    		        
    		        public String toString(){
    		        	return x + " " + y;
    		        }
    		        
    		        public boolean equals(Object o){
    		        	if(o instanceof Pair){
    		        		Pair a = (Pair)o;
    		        		
    		        		return this.x == a.x;
    		        	}
    		        	
    		        	return false;
    		        }
    		        
    		        public int hashCode(){
    		        	return new Long(x).hashCode()*31 + new Long(y).hashCode();
    		        }
    		    
    		    }
    		    
    			
    			public static int gcd(int a, int b) {
    				if (b == 0) return a;
    				return gcd(b, a%b);
    			}
    	
    			void build(int n) {  // build the tree
    				  for (int i = n - 1; i > 0; --i) seg[i] = Math.min(seg[i<<1],seg[i<<1|1]);
    				}
     
    			public static void modify(int p, long val,int n) {  // set value at position p
    				  for (seg[p += n] = val; p > 1; p >>= 1) seg[p>>1] = Math.min(seg[p],seg[p^1]);
    				}
     
    				long query(int l, int r,int n) {  // sum on interval [l, r)
    				  long res = Long.MAX_VALUE;
    				  for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
    				    if ((l&1) == 1) res = (long) Math.min(res,seg[l++]);
    				    if ((r&1) == 1) res = (long)Math.min(res,seg[--r]);
    				  }
    				  return res;
    				}
    				
    			public static void update(int x,int val){
    				while(x<=maxval){
    					tree[x] += val;
    					x = (x&-x);
    				}
    			}
    			
    			public static int read(int idx){
    				int sum = 0;
    				
    				while(idx>= 0){
    					sum += tree[idx];
    					idx -= (idx&(-idx));
    				}
    				
    				return sum;
    			}
     
    		    void solve() throws NumberFormatException, IOException {
    		 
    		    	//Scanner in = new Scanner(System.in);
    		    	int n = in.nextInt();
    		    	
    		    	HashSet<Integer> set = new HashSet();
    		    	
    		    	
    		    	int a[] = new int[n];
    		    	int b[] = new int[n];
    		    	
    		    	for(int i = 0;i<n;i++){
    		    		int c = in.nextInt();
    		    		set.add(c);
    		    		a[i] = c;
    		    	}
    		    	
    		    	for(int i = 0;i<n;i++){
    		    		int c = in.nextInt();
    		    		set.add(c);
    		    		b[i] = c;
    		    	}
    		    	
    		    	int ans = 0;
    		    	
    		    	for(int i = 0;i<n;i++){
    		    		for(int j = 0;j<n;j++){
    		    			int d = a[i]^b[j];
    		    			
    		    			
    		    			if(set.contains(d)){
    		    				ans++;
    		    			}
    		    		}
    		    	}
    		    	
    		    	
    		    	if(ans%2 == 0){
    		    		System.out.println("Karen");
    		    	}else{
    		    		System.out.println("Koyomi");
    		    	}
    		    }
    		    
    		 
    		
    		    public static int Floor(int arr[], int low, int high, int x)
    		    {
    		        // If low and high cross each other
    		        if (low > high)
    		            return -1;
     
    		        // If last element is smaller than x
    		        if (x >= arr[high])
    		            return high;
     
    		        // Find the middle point
    		        int mid = (low+high)/2;
     
    		        // If middle point is floor.
    		        if (arr[mid] == x)
    		            return mid;
     
    		        // If x lies between mid-1 and mid
    		        if (mid > 0 && arr[mid-1] <= x && x < arr[mid])
    		            return mid-1;
     
    		        // If x is smaller than mid, floor must be in
    		        // left half.
    		        if (x < arr[mid])
    		            return Floor(arr, low, mid-1, x);
     
    		        // If mid-1 is not floor and x is greater than
    		        // arr[mid],
    		        return Floor(arr, mid+1, high, x);
    		    }
    		  
    		
    		    public static String[] reverse(String arr[]){
    		    	
    		    	
    		    	for(int i = 0;i<arr.length/2;i++){
    		    		String temp = arr[i];
    		    		arr[i] = arr[arr.length-i-1];
    		    		arr[arr.length-1-i] = temp;
    		    	}
    		    	
    		    	return arr;
    		    	
    		    }
    			
    			
    		    
    		 
    		    public static long sum(long x){
    		    	return x<10?x:x%10 + sum(x/10);
    		    }
    			
    			public static long gcd(long x, long y) {
    				if (x == 0)
    					return y;
    				else
    					return gcd( y % x,x);
    			}
    			static long inv(long x , long mod)
    			{
    				long r,y;
    				for(r=1,y=mod-2;y!=0;x=x*x%mod,y>>=1)
    				{
    					if((y&1)==1)
    						r=r*x%mod;
    				
    				}
    				return r;
    			}
    			
    			public static long pow(long x,long y,long n){
    				if(y==0)
    					return 1%n;
    				if(y%2==0){
    					long z=pow(x,y/2,n);
    					return (z*z)%n;
    				}
    				return ((x%n)*pow(x,y-1,n))%n;
    			}
    			
    			
    			
    			
    			public static boolean isPrime(int n) {
    				// Corner cases
    				if (n <= 1)
    					return false;
    				if (n <= 3)
    					return true;
    		 
    				// This is checked so that we can skip 
    				// middle five numbers in below loop
    				if (n % 2 == 0 || n % 3 == 0)
    					return false;
    		 
    				for (int i = 5; i * i <= n; i = i + 6)
    					if (n % i == 0 || n % (i + 2) == 0)
    						return false;
    		 
    				return true;
    			}
    			
    		
    			void run() throws NumberFormatException, IOException {
    				in = new FastScanner();
    				out = new PrintWriter(System.out);
    		
    				solve();
    		
    				out.close();
    			}
    		
    			class FastScanner {
    				BufferedReader br;
    				StringTokenizer st;
    		
    				public FastScanner() {
    					br = new BufferedReader(new InputStreamReader(System.in));
    				}
    		
    				String next() {
    					while (st == null || !st.hasMoreTokens()) {
    						try {
    							st = new StringTokenizer(in.br.readLine());
    						} catch (IOException e) {
    							// TODO Auto-generated catch block
    							e.printStackTrace();
    						}
    					}
    					return st.nextToken();
    				}
    		
    				int nextInt() {
    					return Integer.parseInt(next());
    				}
    		
    				long nextLong() {
    					return Long.parseLong(next());
    				}
    		
    				double nextDouble() {
    					return Double.parseDouble(next());
    				}
    			}
    			
    			
    			
    			
    		 
    		
    			public static void main(String[] args) throws NumberFormatException, IOException {
    				new prac().run();
    			}
    		}
    		
    		
    		
    		
    		