mod = 998244353
n = int(input())
A = list(map(int, input().split()))
ans = 0
X = [0] * 20
Y = [pow(2, i, mod) for i in range(20)]
for i in range(n):
    for j in range(20):
        if i >> j & 1:
            X[j] += 1

for i in range(n):
    a = i
    for j in range(20):
        if a >> j & 1:
            ans = (ans + A[i]*Y[j]*(n-X[j])) % mod
        else:
            ans = (ans + A[i]*Y[j]*X[j]) % mod
print(ans)