import sys
# input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
# verification-helper: PROBLEM https://judge.yosupo.jp/problem/bitwise_xor_convolution

'''
╺━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━╸
             https://kobejean.github.io/cp-library               
'''

def fwht_pair(A: list[int], B: list[int], N: int):
    Z = len(A)
    for i in range(N):
        m = b = 1<<i
        while m < Z:
            a0, a1, b0, b1 = A[m^b], A[m], B[m^b], B[m]
            A[m^b], A[m], B[m^b], B[m] = a0+a1, a0-a1, b0+b1, b0-b1
            m = m+1|b
    return A, B

def fwht(A: list, N: int):
    Z = len(A)
    for i in range(N):
        m = b = 1<<i
        while m < Z:
            a0, a1 = A[m^b], A[m]
            A[m^b], A[m] = a0+a1, a0-a1
            m = m+1|b
    return A

def xor_conv(A: list, B: list, N: int, mod: int):
    assert len(A) == len(B)
    fwht_pair(A, B, N)
    for i, b in enumerate(B): A[i] = A[i]%mod * (b%mod) % mod
    fwht(A, N)
    inv = pow(len(A), -1, mod)
    for i, a in enumerate(A): A[i] = a%mod * inv%mod
    return A



n = ni()
a = na()
m = 19
f = [0] * (1 << m)
for i in range(n):
    f[i] += a[i]
g = [0] * (1 << m)
for i in range(n):
    g[i] += 1
mod = 998244353
h = xor_conv(f, g, 1 << m, 998244353)
ans = 0
for i in range(1 << m):
    ans += i * h[i] % mod
    ans %= mod

print(ans)