output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      a_1 a_2 \ldots a_{N}
attempt: # -*- coding: utf-8 -*-
  import numpy as np
  
  # 入力
  # a = int(input())
  # b,c = map(int, input().split())
  # s = input()
  
  N = int(input())
  s = input()
  a = np.asarray(s.split(), dtype=int)
  
  # 処理
  
  d = {}
  for val in a:
      if val in d.keys():
          d[val] += 1
      else:
          d[val] = 1
  
  keyNum = len(d.keys())
  num = len(a)
  keys = list(d.keys())
  
  # 条件１
  if len(d.keys()) == 1 and 0 in d.keys():
      print("Yes")
  elif len(a) % 3 != 0:
      print("No")
  elif keyNum == 2:
      keys.sort()
      if keys[0] != 0:
          print("No")
      elif d[0] != num // 3:
          print("No")
      else:
          print("Yes")
  #        keys1 = format(keys[1],'b')
  #        isAll1 = True
  #        for x in keys1:
  #            if x != '1':
  #                isAll1 = False
  #                break
  #        if isAll1:
  #            print ("Yes")
  #        else:
  #            print ("No")
  
  elif keyNum != 3:
      print("No")
  
  else:
      key1 = format(keys[0], "099b")
      key2 = format(keys[1], "099b")
      key3 = format(keys[2], "099b")
      isA = True
      for k1, k2, k3 in zip(key1, key2, key3):
          kk1 = int(k1)
          kk2 = int(k2)
          kk3 = int(k3)
          goukei = kk1 + kk2 + kk3
          if not (goukei == 0 or goukei == 2):
              isA = False
              break
  
      if isA:
          print("Yes")
      else:
          print("No")
  
problem_description: Statement
  
  Snuke has N hats. The i-th hat has an integer a_i written on it.
  
  There are N camels standing in a circle. Snuke will put one of his hats on
  each of these camels.
  
  If there exists a way to distribute the hats to the camels such that the
  following condition is satisfied for every camel, print `Yes`; otherwise,
  print `No`.
  
    * The bitwise XOR of the numbers written on the hats on both adjacent camels is equal to the number on the hat on itself.
  
  What is XOR? The bitwise XOR x_1 \oplus x_2 \oplus \ldots \oplus x_n of n non-
  negative integers x_1, x_2, \ldots, x_n is defined as follows: \- When x_1
  \oplus x_2 \oplus \ldots \oplus x_n is written in base two, the digit in the
  2^k's place (k \geq 0) is 1 if the number of integers among x_1, x_2, \ldots,
  x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if
  that count is even. For example, 3 \oplus 5 = 6.
samples: [{"input": "3\n    1 2 3", "output": "Yes\n    \n\n  * If we put the hats with 1, 2, and 3 in this order, clockwise, the condition will be satisfied for every camel, so the answer is `Yes`.\n\n* * *"}, {"input": "4\n    1 2 4 8", "output": "No\n    \n\n  * There is no such way to distribute the hats; the answer is `No`."}]