import sys
sys.setrecursionlimit(10**7)

N = int(input())
A = list(map(int, input().split()))
MOD = 998244353
A.sort()


def solve(l, r, d):
    if A[l] == A[r] or d < 0:
        return 1
    if (A[l] >> d) & 1 == (A[r] >> d) & 1:
        return solve(l, r, d-1)
    for ind in range(l, r+1):
        if (A[ind] >> d) & 1:
            v = solve(l, ind-1, d-1)*solve(ind, r, d-1) % MOD
            return 2*v % MOD


print(solve(0, N-1, 29))