def solve(n, a):
    MAX = 5000
    dp = [[False]*(MAX+1) for _ in range(n+1)]
    dp[0][0] = True
    for i in range(n):
        for j in range(MAX+1):
            if dp[i][j]:
                dp[i+1][j] = True
                dp[i+1][j^a[i]] = True
    return 'Yes' if dp[n][0] else 'No'

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