n = int(input())
a = list(map(int, input().split()))
x = [0] * 20
for i in range(n):
    for bit in range(20):
        if i & (1 << bit):
            x[bit] += 1
# i xor j = i + j - 2 * (i & j)
mod = 998244353
ans = 0
for i in range(n):
    ans += a[i] * (i * n + n * (n - 1) // 2) % mod
for i in range(n):
    for bit in range(20):
        if i & (1 << bit):
            ans -= 2 * a[i] * x[bit] * (1 << bit) % mod
            ans %= mod
print(ans)