import sys
from collections import defaultdict, Counter, deque
from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate
import operator
from math import sqrt, gcd, factorial
# from math import isqrt, prod,comb  # python3.8用(notpypy)
#from bisect import bisect_left,bisect_right
#from functools import lru_cache,reduce
#from heapq import heappush,heappop,heapify,heappushpop,heapreplace
import numpy as np
#import networkx as nx
#from networkx.utils import UnionFind
#from numba import njit, b1, i1, i4, i8, f8
#from scipy.sparse import csr_matrix
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError
# numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1
def input(): return sys.stdin.readline().rstrip()
def divceil(n, k): return 1+(n-1)//k  # n/kの切り上げを返す
def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)


def hakidashi(A):
    AA = np.sort(A)[::-1]
    ans = []
    while AA.shape[0] and AA[0]:
        ans.append(AA[0])
        AA[np.where(AA ^ AA[0] < AA)[0]] ^= AA[0]
        AA = np.sort(AA)[::-1]
    return np.array(ans)
 
 
 
 
def highest_bit(v):
    """
    Vの最上位ビットのみを残した値を作る。
    """
    v = v | (v >> 1)
    v = v | (v >> 2)
    v = v | (v >> 4)
    v = v | (v >> 8)
    v = v | (v >> 16)
    v = v | (v >> 32)
    return v ^ (v >> 1)
 
 
 
 
def hakidashi_hantei(ans, K):
    for aa in ans:
        if highest_bit(aa) & K:
            K ^= aa
    return K == 0


def hakidashi_hantei(ans, K):
    for aa in ans:
        if highest_bit(aa) & K:
            K ^= aa
    return K == 0


def main():
    mod = 10**9+7
    mod2 = 998244353
    n= int(input())
    A = np.array(list(map(int, input().split())), dtype=np.int64)
    print(2**len(hakidashi(A)))


if __name__ == '__main__':
    main()