Problem:


Score : 100 points

Problem Statement

An elementary school student Takahashi has come to a variety store.

He has two coins, A-yen and B-yen coins (yen is the currency of Japan), and wants to buy a toy that costs C yen. Can he buy it?

Note that he lives in Takahashi Kingdom, and may have coins that do not exist in Japan.

Constraints

All input values are integers.

1 \leq A, B \leq 500

1 \leq C \leq 1000

Input

Input is given from Standard Input in the following format:

A B C

Output

If Takahashi can buy the toy, print Yes; if he cannot, print No.

Sample Input 1

50 100 120

Sample Output 1

Yes

He has 50 + 100 = 150 yen, so he can buy the 120-yen toy.

Sample Input 2

500 100 1000

Sample Output 2

No

He has 500 + 100 = 600 yen, but he cannot buy the 1000-yen toy.

Sample Input 3

19 123 143

Sample Output 3

No

There are 19-yen and 123-yen coins in Takahashi Kingdom, which are rather hard to use.

Sample Input 4

19 123 142

Sample Output 4

Yes



Sample input:
50 100 120


Sample output:
Yes

Submission status: Runtime Error

Solution code:
N = int(input())
a_b = sorted([list(map(int, input().split())) for _ in range(N)], key=lambda x: x[1])
a_b = sorted(a_b)
c_d = sorted([list(map(int, input().split())) for _ in range(N)], key=lambda x: x[1])
c_d = sorted(c_d)

ans = 0
for a, b in a_b:
    check = 0
    pair = [1000, -1000]
    for i, cd in enumerate(c_d):
        if a < cd[0] and b < cd[1] and check==0:
            if b > pair[1]:
                pair = c_d[i]
                c_d.remove(c_d[i])
                check += 1
                ans += 1
         
print(ans)

Submission status: Runtime Error

Solution code:
N = int(input())
a_b = sorted([list(map(int, input().split())) for _ in range(N)], key=lambda x: x[1])
a_b = sorted(a_b)
c_d = sorted([list(map(int, input().split())) for _ in range(N)], key=lambda x: x[1])
c_d = sorted(c_d)

ans = 0
for a, b in a_b:
    check = 0
    for i, cd in enumerate(c_d):
        if a < cd[0] and b < cd[1] and check==0:       
            c_d.remove(c_d[i])
            check += 1
            ans += 1
         
print(ans)

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
print('Yes':if a+b>=c,else:'No')

Submission status: Runtime Error

Solution code:
# -*- coding: <encoding name> -*-

a, b, c = map(int, input().split())
print('Yes' if A + B >= C else 'No')

Submission status: Runtime Error

Solution code:
a,b,n = map(int,input().split())
if a+b>=c:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
A,B,C=map(int,input())
if A+B > C:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
A,B,C=map(int,input())
if A+B > C:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
A, B, C=map(int,input().split())
if A+B >= C:
  ptint('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
def main():
  import sys
  input = sys.stdin.readline
  import bisect
  import numpy as np
  n = int(input())
  a = list(map(int,input().split()))
  b = list(map(int,input().split()))
  x = max(max(a),max(b)).bit_length()+1
  b = np.array(b,dtype=np.int32)
  ans = 0
  for i in range(1,x+1):
    d = sorted(b&(1<<i)-1)
    t = 1<<(i-1)
    anstmp = 0
    for j in range(n):
      y = a[j]&(1<<i)-1
      t1 = np.searchsorted(d,t-y)
      t2 = np.searchsorted(d,2*t-y)
      t3 = np.searchsorted(d,3*t-y)
      anstmp += (t2-t1)+(n-t3)
    if anstmp%2:
      ans += t
  print(ans)
main()

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline
import bisect
import numpy as np
n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
x = max(max(a),max(b)).bit_length()+1
b = np.array(b)
ans = 0
for i in range(1,x+1):
  d = np.sort(np.bitwise_and(b,(1<<i)-1))
  t = 1<<(i-1)
  anstmp = 0
  for j in range(n):
    y = a[j]&(1<<i)-1
    t1 = np.searchsorted(d,t-y)
    t2 = np.searchsorted(d,2*t-y)
    t3 = np.searchsorted(d,3*t-y)
    t4 = np.searchsorted(d,4*t-y)
    anstmp += (t2-t1)+(t4-t3)
  if anstmp%2:
    ans += t
print(ans)

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline
import bisect
import numpy as np
n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
a = np.array(a)
b = np.array(b)
x = max(max(a),max(b)).bit_length()+1
ans = 0
for i in range(1,x+1):
  c = sorted(np.bitwise_and(a,(1<<i)-1))
  d = sorted(np.bitwise_and(b,(1<<i)-1))
  t = 1<<(i-1)
  anstmp = 0
  for j in range(n):
    t1 = np.searchsorted(d,t-c[j])
    t2 = np.searchsorted(d,2*t-c[j])
    t3 = np.searchsorted(d,3*t-c[j])
    t4 = np.searchsorted(d,4*t-c[j])
    anstmp += (t2-t1)+(t4-t3)
  if anstmp%2:
    ans += t
print(ans)

Submission status: Runtime Error

Solution code:
from numpy import *;i=int32;p=input;q=searchsorted;N=int(p());A=i(p().split());B=i(p().split());c=0;
for k in range(1,30):
  a,b=sort(hstack((A%(1<<k),A%(1<<k)-2**k))),B%(1<<k);c+=((sum(q(a,2**k-b)-q(a,2**(k-1)-b)))&1)<<k-1
print(c)

Submission status: Runtime Error

Solution code:
from numpy import *;i=int32;p=input;q=searchsorted;N=int(p());A=i(p().split());B=i(p().split());c=0;
for k in range(1,30):
  a,b=sort(hstack((A%(1<<k),A%(1<<k)-2**k))),B%(1<<k);c+=(sum(q(a,2**k-b)-q(a,2**(k-1)-b)))&1<<k-1
print(c)

Submission status: Runtime Error

Solution code:
import numpy as n;i=n.int32;p=input;q=n.searchsorted;N=int(p());A=i(p().split());B=i(p().split());c=0;
for k in range(1,30):
  a,b=n.sort(n.hstack((A%(1<<k),A%(1<<k)-2**k))),B%(1<<k);c+=(n.sum(q(a,2**k-b)-q(a,2**(k-1)-b)))%2*2**(k-1)
print(c)

Submission status: Runtime Error

Solution code:
a, b, c = map(int,input().split())

if　(a + b) >= c:
  print("Yes")
  
else:
  print("No")

Submission status: Runtime Error

Solution code:
a, b, c = map(int,input().split())

if　(a + b) >= C:
  print("Yes")
  
else:
  print("No")

Submission status: Runtime Error

Solution code:
a, b, c = map(int,input().split())

if　(a + b) <= C:
  print("Yes")
  
else:
  print("No")

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input(),split())
if a+b >= c:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
50 100 120

Submission status: Runtime Error

Solution code:
n=int(input())
s=[input() for i in range(n)]
m=int(input())
t=[input() for i in range(m)]
l=list(set(s))
print(max(s.count(l[i])-t.count(l[i]) for i in range(len(l))))

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())

if a + b > c:
	Print("Yes")
Else:
	Print("No")

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
if a+b=>c:
	print('Yes')
else:
	print('No')

Submission status: Runtime Error

Solution code:
C=int(input())
A,B=map(int,input().split())

if A+B >= C:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
A=int(input())
B,C=map(int,input().split())

if A+B>=C:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
A=int(input())
B,C=map(int,input().solit())

if A+B>=C:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
a,b,c=map(input().split())
print('YNeos'[a+b<c::2])

Submission status: Runtime Error

Solution code:
a=input ()
b=input ()
c=input ()
if a+b >= c:
    print ("Yes")
else :
    print ("No")

Submission status: Runtime Error

Solution code:
A, B, C =map(int, input().split())
if A + B => C:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
a, b, c = mapt(int, input().split())
if a + b >= c:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
a,b,c=list(map(int input().split()))
if a+b >= c:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
A,B,C=map(int,input().split())
if A+B=>C:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
a,b,c=map(int,raw_input().split())
if a+b=>c:
  print "Yes"
else:
  print "No"

Submission status: Runtime Error

Solution code:
a,b,c=map(int,raw_input().split())
if a+b=>c:
  print "Yes"
else:
  print "No"

Submission status: Runtime Error

Solution code:
a,b,c=map(int,raw_input().split())
if a+b=>c:
  print "yes"
elif c>a+b:
  print "no"

Submission status: Runtime Error

Solution code:
a=input()
b=input()
c=input()
if a+b>c:
  print "yes"
else:
  print "no"

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input())
if a+b>c:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input())
if a+b>=c:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define reprl(i, n) for(ll i = n; i >= 0; i--)
#define fori(i, m, n) for(int i = m; i < (int)n; i++)
#define forl(i, m, n) for(ll i = m; i < (ll)n; i++)
#define all(v) v.begin(), v.end()
ll gcd(ll a,ll b) {
  return b? gcd(b,a%b): a;  
}
ll lcm(ll a,ll b) {
  return a*b/gcd(a,b);
}
bool isLowerCase(char c){
  return (c>='a'&&c<='z');
}
const string bans(bool ans){
  return (ans?"Yes":"No");
}
int main() {
  int a,b,c;cin>>a>>b>>c;
  int ans=(a>=c||b>=c||a+b>=c);
  cout << bans(ans) << endl;
  return 0;
}

Submission status: Runtime Error

Solution code:
a,b,c=[map(int,input().split())]
print("Yes" if a>=c or b>=c or a+b>=c else "No")

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input())
print("Yes" a+b>=c else"No")

Submission status: Runtime Error

Solution code:
a,b = map(int,input().split())
print("Yes" a+b>=c else "NO")

Submission status: Runtime Error

Solution code:
import collections

n = int(input())
s = [input() for _ in range(n)]
m = int(input())
t = [input() for _ in range(m)]

S = collections.Counter(s)
T = collections.Counter(t)

ans = [0]
for key, cont in S:
    if cont > T[key]:
        ans.append(cont - T[key])
print(max(ans))

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input())

if a+b >= c:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input())

if a+b >= c:
  print("yes")
else:
  print("no")

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input())

if a+b > c:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
n = int(input())
s = [input() for _ in range(n)]
m = int(input())
t = [input() for i in range(m)]

l = []
for i in range(n):
  S = s.count(s[i])
  T = t.count(s[i])
  l.append(S - T)
  
if max(l) < 0:
  print("0")
else:
  print(max(l))

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input())
if a+b >= c:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
a,b,c,d=map(int,input().split())
if abs(a-b)<=d and abs(b-c)<=d:
  if abs(a-c)<=d:
    print("Yes")
  else:
    print("No")
else:
  print("No")

Submission status: Runtime Error

Solution code:
a,b,c = map(int, input().split())

pirnt('Yes' if a+b >= c else 'No')

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input())
print("Yes" if a+b>=c else "No")

Submission status: Runtime Error

Solution code:
A, B, C = map(int, input.split())
if A+B >= C:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
hymju

Submission status: Runtime Error

Solution code:
n = [input() for _ in range(int(input()))]
m = [input() for _ in range(int(input()))]
 
Vocab = list(set(n))
MAX = max(n.count(Vocab[i])-m.count(Vocab[i]) for i in range(len(Vocab)))
print(max(0,max))

Submission status: Runtime Error

Solution code:
n = [input() for_ in range(int(input()))]
m = [input() for_ in range(int(input()))]

Vocab = list(set(n))
MAX = max(n.count(Vocab[i])-m.count(Vocab[i]) for i in range(len(Vocab)))
print(max(0,max))

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input.split())
print('Yes' if a+b >= c else 'No')

Submission status: Runtime Error

Solution code:
A,B,C = map(int, input().split())
if A+B == C:
  print("Yes")
else:
  prin("No")

Submission status: Runtime Error

Solution code:
S = [input() for _ in range(int(input()))]
T = [input() for _ in range(int(input()))]
ans = 0
for s in set(S):
    score = S.count(s) - T.count(s)
    if score > ans:
        ans = score
print(ans)

Submission status: Runtime Error

Solution code:
A, B, C = map(int, input())
print("Yes" if A + B >= C else "No")

Submission status: Runtime Error

Solution code:
A, B, C = map(input(), int)
print("Yes" if A + B >= C else "No")

Submission status: Runtime Error

Solution code:
a,b,c = map(int, imput().split())

if (a+b) >= c:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
n = int(input())
s = [input() for i in range(n)]
m = int(input())
t = [input() for i in range(m)]

ans = 0
for i in s:
  ans=max(ans, s.count(i)- t.count(i))
print(ans)

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input())
if a+b>=c:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
A,B,C = map(int,input().split())

if A+B <= C
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
a,b,c = map(int, input().split)

if a+b >= c:
	print('Yes')
else:
	print('No')

Submission status: Runtime Error

Solution code:
A, B, C = map(int, input())

if A+B >= C:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
print('Yes' if a+b >= c else No)

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())
if a + b> c:
    print(Yes)
else:
    print(No)

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())
print('Yes' if a+b>=c, else 'No')

Submission status: Runtime Error

Solution code:
a,b,c=int(input())
print("Yes" if (a+b) > c "No" else)

Submission status: Runtime Error

Solution code:
19 123 143

Submission status: Runtime Error

Solution code:
A,B,C=map(int,input().split())
printf("Yes" if A+B>=C else "No")

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())

if a+b <= c:
  print('Yes')
else:
  priny('No')

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;

int main(){
    int A,B,C;
    cin >> A >> B >> C;
    if (A + B >= C){
        cout << "Yes" << endl;
    }
    else{
        cout << "No" << endl;
    }
}

Submission status: Runtime Error

Solution code:
a, b, c = map(int(input().split()))

if a + b >= c:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
n=[input() for _ in range(int(input()))]
m=[input() for _ in range(int(input()))]
l=list(set(n))
print(max(0,max(n.count(l[i])-m.count(l[i]) for i in range(len(l)))))

Submission status: Runtime Error

Solution code:
n=[input() for _ in range(int(input()))]
m=[input() for _ in range(int(input()))]
l = list( set(n) )
print(max(0,max(n.count(l[i])-m.count(l[i]) for i in range(len(l)))))

Submission status: Runtime Error

Solution code:
n=[input() for _ in range(int(input()))]
m = [ input() for _ in range( int( input() ) )]
l = list( set(n) )
print(max(0,max(n.count(l[i])-m.count(l[i]) for i in range(len(l)))))

Submission status: Runtime Error

Solution code:
n = [ input() for _ in range( int( input() ) )]
m = [ input() for _ in range( int( input() ) )]
l = list( set(n) )
print(max(0,max(n.count(l[i])-m.count(l[i]) for i in range(len(l)))))

Submission status: Runtime Error

Solution code:
n = [ input() for _ in range( int( input() ) )]
m = [ input() for = in range( int( input() ) )]
l = list( set(n) )
print(max(0,max(n.count(l[i])-m.count(l[i]) for i in range(len(l)))))

Submission status: Runtime Error

Solution code:
n = [ input() for _ in range( int( input() ) )]
m = [ input() for = in range( int( input() ) )]
l = list( set(n) )
print( max(0, max( n.count(l[i]) - m.count(l[i]) for i in range( len(l) ) ) ) )

Submission status: Runtime Error

Solution code:
n = [input() for _ in range(int(input()))]
m = [input() for _ in range(int(input()))]
l = list(set(n))

print(max(0,max(n.count(l[i])-m.count(l[i])for i in range(len(l)))))

Submission status: Runtime Error

Solution code:
n=[input() for _ in range(int(input()))]
m=[input() for _ in range(int(input()))]
l=list(set(n))
print(max(0,max(n.count(l[i])-m.count(l[i]) for i in range(len(l)))))

Submission status: Runtime Error

Solution code:
from collections import Counter

n = int(input())
b = [input() for _ in range(n)]
m = int(input())
r = [input() for _ in range(m)]

db, dr = [Counter(x) for x in (b, r)]
print(max(*[v-dr[k] for k, v in db.items()]+[0]))

Submission status: Runtime Error

Solution code:
A = int(input())
B = int(input())
C = int(input())

print('Yes') if A+B >= C else print('No')

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
print("Yes"a+b>=c else"No")

Submission status: Runtime Error

Solution code:
A, B, C = map(int, input().split())
if A + B => C:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
a,b,c = map(int, input().split())
if a+b>=c:
    print("Yes")
if a+b < c
    print("NO")

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input().split())
if a+b <= c:
  print("Yes)
else:
  print("No")

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input().split())
if a+b <= c:
	print("Yes)
else:
	print("No")

Submission status: Runtime Error

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
import numpy as np
sys.setrecursionlimit(10**5)
stdin = sys.stdin
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007

#A
def A():
    a, b, c = map(int, input().split())
    if a + b >= c:
        print("Yes")
    else:
        print("No")
    return



#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Runtime Error

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
import numpy as np
sys.setrecursionlimit(10**5)
stdin = sys.stdin
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007

#A
def A():
    a, b, c = LI()
    if a + b >= c:
        print("Yes")
    else:
        print("No")
    return



#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Runtime Error

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
import numpy as np
sys.setrecursionlimit(10**5)
stdin = sys.stdin
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007

#A
def A():
    a, b, c = LI()
    if a + b >= c:
        print("Yes")
    else:
        print("No")
    return

#B
def B():
    return

#C
def C():
    n = II()
    ab = LIR(n)
    cd = LIR(n)
    ab.sort()
    cd.sort()
    check = [0 for i in range(n)]
    ans = 0
    #print(ab)
    for i, c in enumerate(cd):
        d = c[1]
        c = c[0]
        maxy = -1
        x = -1
        for k, a in enumerate(ab):
            b = a[1]
            a = a[0]
            if maxy < b and c > a and check[k] == 0 and d > b:
                maxy = b
                x = k
                #print(a,b,c,d)
        if x != -1:
            ans += 1
            check[x] += 1
    print(ans)


    return

#D
def D():
    N = II()
    a = LI()
    b = LI()
    ans = 0
    for i in range(29):
        t = 2 ** i
        a2 = [A % (2 * t) for A in a]
        b2 = [B % (2 * t) for B in b]
        a2.sort()
        b2.sort()
        ansb = 0
        for A in a2:
            ansb += np.searchsorted(b2, 2 * t - A) - np.searchsorted(b2, t - A)
            ansb += N - np.searchsorted(b2, 3* t - A)
            #print(ansb)
        #ans += (ansb % 2) << i
        ans += ((ansb %2 ) << i)
    print(ans)
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Runtime Error

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
import numpy as np
sys.setrecursionlimit(10**5)
stdin = sys.stdin
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007

#A
def A():
    a, b, c = LI()
    if a + b >= c:
        print("Yes")
    else:
        print("No")
    return

#B
def B():
    return

#C
def C():
    n = II()
    ab = LIR(n)
    cd = LIR(n)
    ab.sort()
    cd.sort()
    check = [0 for i in range(n)]
    ans = 0
    #print(ab)
    for i, c in enumerate(cd):
        d = c[1]
        c = c[0]
        maxy = -1
        x = -1
        for k, a in enumerate(ab):
            b = a[1]
            a = a[0]
            if maxy < b and c > a and check[k] == 0 and d > b:
                maxy = b
                x = k
                #print(a,b,c,d)
        if x != -1:
            ans += 1
            check[x] += 1
    print(ans)


    return

#D
def D():
    N = II()
    a = LI()
    b = LI()
    ans = 0
    for i in range(29):
        t = 2 ** i
        a2 = [A % (2 * t) for A in a]
        b2 = [B % (2 * t) for B in b]
        a2.sort()
        b2.sort()
        ansb = 0
        for A in a2:
            ansb += np.searchsorted(b2, 2 * t - A) - np.searchsorted(b2, t - A)
            ansb += N - np.searchsorted(b2, 3* t - A)
            #print(ansb)
        #ans += (ansb % 2) << i
        ans += ((ansb %2 ) << i)
    print(ans)
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    D()

Submission status: Runtime Error

Solution code:
N = int(input())
S = [input() for i in range(N)]
M = int(input())
T = [input() for i in range(M)]
 
Scores = []
for s in S:
  score = len([s2 for s2 in S if s == s2])
  score -= len([s2 for s2 in T if s == s2])
  Scores.append(score)
print(max(Scores) if max(Scores)>0 else 0)

Submission status: Runtime Error

Solution code:
A,B,C = map(int,input())

if A + B >= C:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
A,B,C = map(int,(input()))

if A + B >= C:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
A,B,C = map(int(input()))

if A + B >= C:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
a = list(map(int,input()))
if a[0]+a[1]>=a[2]:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
p = lambda: int(input())
if (p()+p())<p():
  print("No")
else:
  print("Yes")

Submission status: Runtime Error

Solution code:
import copy
n = int(input())
red = []
blue = []
for _ in range(n):
    a, b = map(int, input().split())
    red.append([a, b])
for _ in range(n):
    c, d = map(int, input().split())
    blue.append([c, d])

red_list = copy.copy(red)
blue_list = copy.copy(blue)
    
red_list.sort()
blue_list.sort()
count = 0
for i in range(n):
    a, b = red_list.pop(0)
    for j in range(len(blue_list)):
        if (a < blue_list[j][0]) & (b < blue_list[j][1]):
            count += 1
            blue_list.pop(j)
            break

red_list = copy.copy(red)
blue_list = copy.copy(blue)
    
red_list.sort(key=lambda x: x[1])
blue_list.sort(key=lambda x: x[1])
count1 = 0
for i in range(n):
    a, b = red_list.pop(0)
    for j in range(len(blue_list)):
        if (a < blue_list[j][0]) & (b < blue_list[j][1]):
            count1 += 1
            blue_list.pop(j)
            break            

ans = max(count, count1)        
print(ans)

Submission status: Runtime Error

Solution code:
s = list(map(int,input()))
a = s[0]
b = s[1]
c = s[2]
if a + b >= c:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
import bisect
N=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
ans=[]
for i in range(28):
  T=2**i
  B_=list(B)
  A_=list(A)
  t=0
  for j in range(N):
    B_[j]%=2*T
    A_[j]%=2*T
  B_.sort()
  for j in range(N):
    a=A_[j]
    p=bisect.bisect_left(B_,T-a)
    q=bisect.bisect_left(B_,2*T-a)
    r=bisect.bisect_left(B_,3*T-a)
    s=bisect.bisect_left(B_,4*T-a)
    t+=(q-p)+(s-r)
  ans.append(t%2)
a=0
for i in range(28):
  a+=2**i*ans[i]
print(a)

Submission status: Runtime Error

Solution code:
ans = "No"
if int(input()) + int(input()) >= int(input()):
  ans = "Yes"
print(ans)

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().splite())
if a+b < c:
  print("No")
else:
  print("Yes")

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().solit())
if a + b >= c:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
if int(input()) + int(input()) >= int(input()):
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
if input() + input() >= input():
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
A,B,C = map(int,input().split())
money = A+B
if C>money:
    print('No')
else:
    print('Yes)

Submission status: Runtime Error

Solution code:
a,b,c=map(int,int().split())
if a+b>=c:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
x = [int(input()) for i in range(4)]
print(min(x[0],x[1]) + min(x[2],x[3]))

Submission status: Runtime Error

Solution code:
n=int(input())
sn=[input() for _ in range(n)]
m=int(input())
sm=[input() for _ in range(m)]
l=list(set(sn))
print(max(0,max([sn.count(l[i])-sm.count(l[i]) for i in range(len(l))])))

Submission status: Runtime Error

Solution code:
a,b,c = list(map(int,input()))
if a + b < c:
  print("No")
else:
  print("Yes")

Submission status: Runtime Error

Solution code:
a,b,c = list(map(int,input()))
if a + b <= c:
  print("No")
else:
  print("Yes")

Submission status: Runtime Error

Solution code:
    a,b,c=map(int, input().split())
     
    if a+b>=c:
      print("Yes")
    else:
      print("No")

Submission status: Runtime Error

Solution code:
a,b,c=map(int, input().split)

if a+b>=c:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
if("Yes" if a+b>=c else "No")

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())
if a+b => c:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())
if a+b =< c:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
A, B, C = map(int, input())

if (A+B) > C:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
A, B, C = map(int,input().split())
if A + B => C :
  print("Yes")
else :
  print("No")

Submission status: Runtime Error

Solution code:
A,B,C = map(int,input().split())
if A + B => C :
  print("Yes")
else :
  print("No")

Submission status: Runtime Error

Solution code:
A,B,C = (int,input().split())
if A + B => C :
  print("Yes")
else :
  print("No")

Submission status: Runtime Error

Solution code:
A,B,C = (int,input().split())
if A + B => C :
  print("Yes")
else :
  print("NO)

Submission status: Runtime Error

Solution code:
A,B,C = map(int, input().split())
if A+B >= C:
  print('Yes')
else:
  print('No)

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())

if a+b >= c
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().spilt())
print('Yes' if a + b >= c else 'No')

Submission status: Runtime Error

Solution code:
looll

Submission status: Runtime Error

Solution code:
, b, c = map(int, input().split())

if (a + b) <= c:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
if int(input())+int(input())<int(input()):print("No")
else:print("Yes")

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())
c=int(input())
if(a+b>c): print("Yes")
else: print("No")

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())
c=int(input())
if a+b>c: print("Yes")
else: print("No")

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())
c=int(input())
if(a+b>c) print("Yes")
else print("No")

Submission status: Runtime Error

Solution code:
a=int(input());
b=int(input());
c=int(input());
if(a+b>c) print("Yes");
else print("No");

Submission status: Runtime Error

Solution code:
a,b,c=list(int,input().split())
if  (a+b)>=c:
    print("Yes")
else:
    print("No")