Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define ll long long
- #define pb push_back
- #define mp make_pair
- #define pii pair<int,int>
- #define vi vector<int>
- #define all(a) (a).begin(),(a).end()
- #define lol 1000000007
- #define endl '\n'
- #define rep(i,a,b) for(int i=a;i<b;i++)
- using namespace std;
- void MOD(ll &x)
- {
- if (x >= lol) x -= lol;
- if (x < 0) x += lol;
- }
- void solve()
- {
- int n;
- cin>>n;
- ll x[n], y[n];
- rep(i,0,n)
- {
- cin>>x[i];
- }
- rep(i,0,n)
- {
- cin>>y[i];
- }
- ll count = 0;
- rep(i,0,n)
- {
- ll c = x[i]^y[i];
- //cout<<c<<" ";
- rep(j,0,n)
- {
- if(c==x[j]||c==y[j])
- {
- count++;
- goto l;
- }
- }
- l:;
- }
- //cout<<count<<endl;
- if(count%2==0)
- cout<<"Karen"<<endl;
- else
- cout<<"Koyomi"<<endl;
- }
- int main()
- {
- ios_base::sync_with_stdio(false);
- cin.tie(0);
- cout.tie(0);
- int t=1;
- // cin>>t;
- while(t--){
- solve();
- }
- return 0;
- }
Add Comment
Please, Sign In to add comment