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: N = int(input())
  a = list(map(int, input().split()))
  
  
  def ronriwa(a, b):
      global ab2
      global sa
      a2 = list(str(bin(a)))[2:]
      b2 = list(str(bin(b)))[2:]
      len_a = len(a2)
      len_b = len(b2)
      if len_a >= len_b:
          sa = len_a - len_b
          ab2 = a2[:sa]
          for i in range(len_b):
              if all([a2[sa + i] == "0", b2[i] == "0"]):
                  ab2.append("0")
              elif all([a2[sa + i] == "0", b2[i] == "1"]):
                  ab2.append("1")
              elif all([a2[sa + i] == "1", b2[i] == "0"]):
                  ab2.append("1")
              else:
                  ab2.append("0")
      elif len_a < len_b:
  
          sa = len_b - len_a
          ab2 = b2[:sa]
  
          for i in range(len_a):
              if all([a2[i] == "0", b2[sa + i] == "0"]):
                  ab2.append("0")
              elif all([a2[i] == "0", b2[sa + i] == "1"]):
                  ab2.append("1")
              elif all([a2[i] == "1", b2[sa + i] == "0"]):
                  ab2.append("1")
              else:
                  ab2.append("0")
  
      ab10 = ""
      for i in ab2:
          ab10 += str(i)
  
      return int(ab10, 2)
  
  
  t_f = []
  
  for i in range(0, N):
      if i == 0:
          tf = ronriwa(a[N - 1], a[1])
          t_f.append(a[i] == tf)
      elif i == N - 1:
          tf = ronriwa(a[N - 2], a[0])
          t_f.append(a[i] == tf)
      else:
          tf = ronriwa(a[i - 1], a[i + 1])
          t_f.append(a[i] == tf)
  if all(t_f):
      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`."}]