# -*- coding: utf-8 -*-

import functools
import operator

n = int(input())
a = sorted(map(int, input().split()))
max_a = 2**13

x = functools.reduce(operator.xor, a)

if x != 0:
    print("No")
    exit()


# dp[i][b] := i番目までの整数を利用して、xor が b になるような組み合わせが存在するか
dp = [[False] * (max_a + 1) for _ in range(n)]

dp[0][a[0]] = True

for i in range(1, n):
    for b in range(max_a):
        dp[i][b] |= dp[i - 1][b]
        dp[i][b ^ a[i]] |= dp[i - 1][b]


if any(dp[i][0] for i in range(n - 1)):
    print("Yes")
else:
    print("No")