output_description: If Takahashi can buy the toy, print `Yes`; if he cannot, print `No`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      A B C
attempt: 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()
  
problem_description: 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.
samples: [{"input": "50 100 120", "output": "Yes\n    \n\nHe has 50 + 100 = 150 yen, so he can buy the 120-yen toy.\n\n* * *"}, {"input": "500 100 1000", "output": "No\n    \n\nHe has 500 + 100 = 600 yen, but he cannot buy the 1000-yen toy.\n\n* * *"}, {"input": "19 123 143", "output": "No\n    \n\nThere are 19-yen and 123-yen coins in Takahashi Kingdom, which are rather hard\nto use.\n\n* * *"}, {"input": "19 123 142", "output": "Yes"}]