from collections import *
import heapq

N = int(input())
A = [int(input()) for _ in range(2**N)]
if A[0] != 0:
    print("No")
    exit()
for i in range(1 << N):
    now = 0
    for j in range(17):
        if (i >> j) & 1 == 1:
            now ^= A[1 << j]
    if now != A[i]:
        print("No")
        exit()
print("Yes")