import sys

# import bisect #二分探索
# import math

from collections import deque
from collections import defaultdict


def I():
    return int(sys.stdin.readline().rstrip())


def MI():
    return map(int, sys.stdin.readline().rstrip().split())


def LI():
    return list(map(int, sys.stdin.readline().rstrip().split()))


def LI2():
    return list(map(int, sys.stdin.readline().rstrip()))


def S():
    return sys.stdin.readline().rstrip()


def LS():
    return list(sys.stdin.readline().rstrip().split())


def LS2():
    return list(sys.stdin.readline().rstrip())

# 1次元の配列
# list(map(int, input().split()))
# 2次元の配列
# [list(map(int, input().split())) for i in range()]
# wsl pypy3 ファイル名

input = sys.stdin.readline
from collections import Counter, defaultdict


n = I()
a_cnt = Counter(LI())

dp = defaultdict(int)
dp[0] = 1
for a in sorted(a_cnt.keys()):
    ndp = defaultdict(int)
    mul = 1 << (a_cnt[a] - 1)
    for v, c in dp.items():
        ndp[v] += c * mul
        ndp[v ^ a] += c * mul
    dp = ndp

if dp[0] ==2:
    print("No")
else:
    print("Yes")