#!/usr/bin/python3

# 2
# 1 1
# でYesを返す噓解法


import sys

n = int(input())
a = list(map(int, input().split()))

xor_s = 0
for i in range(n):
    xor_s ^= a[i]

if xor_s != 0:
    print("No")
    sys.exit()

if n > 5001:
    print("Yes")
    sys.exit()

MAX_XOR = 2**13

dp = [[False for j in range(MAX_XOR)] for i in range(n)]

dp[1][a[1]] = True

# 配るDP
for i in range(1, n - 1):
    dp[i + 1] = dp[i]
    dp[i + 1][a[i + 1]] = True
    for j in range(MAX_XOR):
        if (dp[i][j] == False):
            continue
        dp[i + 1][j ^ a[i + 1]] = True

if (dp[n - 1][a[0]] == True):
    print("Yes")
else:
    print("No")