#fmhrさんを参考に・・・
def hihgest_one_bit(i):
    return 1 << i.bit_length() - 1

def solve(a):
    ret = 0
    for i, ai in enumerate(a):
        if ai:
            ret += 1
            x = hihgest_one_bit(ai)
            for y in range(i + 1, len(a)):
                if a[y] & x:a[y] ^= ai
    return ret

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

print(1 << solve(a))