MOD = 998244353


def fwht(a) -> None:
    n = len(a)
    i = 1
    while i < n:
        for j in range(n):
            if (j & i) == 0:
                x, y = a[j], a[j | i]
                a[j] = (x + y) % MOD
                a[j | i] = (x - y) % MOD
        i *= 2


def ifwht(a) -> None:
    inv_2 = pow(2, MOD - 2, MOD)
    n = len(a)
    i = 1
    while i < n:
        for j in range(n):
            if (j & i) == 0:
                x, y = a[j], a[j | i]
                a[j] = (x + y) * inv_2 % MOD
                a[j | i] = (x - y) * inv_2 % MOD
        i *= 2


sz = 1 << 10
n = int(input())
a = list(map(int, input().split()))
while len(a) < sz:
    a.append(0)
s = sum(a)
sinv = pow(s, MOD - 2, MOD)
f = [0 for i in range(sz)]
f[0] = 1
for i in range(1, sz):
    f[i] = -a[i] * sinv % MOD
res = 0
for x in range(1, sz):
    g = f.copy()
    g[x] = 0
    fwht(g)
    for i in range(len(g)):
        g[i] = pow(g[i], MOD - 2, MOD)
    ifwht(g)
    res += g[x]
    res %= MOD
res *= a[0]
res %= MOD
res *= sinv
res %= MOD
print(res)