n,*a=map(int,open(0).read().split())
m=13
x=0
for i in a:
  x^=i
if x:
  exit(print('No'))
d=[[]for _ in range(m)]
for i in range(1,n):
  for j in range(m):
    if a[i]>>j&1:
      d[j]+=i,
q=[(a[0],1)]
while q:
  p,j=q.pop()
  if p==0 and j<n:
    exit(print('Yes'))
  for i in range(m):
    if p>>i&1:
      while d[i]:
        v=d[i].pop()
        q+=(p^a[v],j+1),
print('No')