def solve():
    N = int(input().strip())
    A = list(map(int, input().strip().split()))
    
    xor_all = 0
    for a in A:
        xor_all ^= a

    if xor_all != 0:
        print('No')
        return

    xor_cum = [0]*(N+1)
    for i in range(N):
        xor_cum[i+1] = xor_cum[i] ^ A[i]

    dp = [[0]*(xor_all+1) for _ in range(N+1)]
    dp[0][0] = 1

    for i in range(N):
        for j in range(xor_all+1):
            if dp[i][j]:
                dp[i+1][j] = 1
                if j^xor_cum[i+1] <= xor_all:
                    dp[i+1][j^xor_cum[i+1]] = 1

    if dp[N][0]:
        print('Yes')
    else:
        print('No')

solve()