def popcount(x):
    x = x - ((x >> 1) & 0x55555555)
    x = (x & 0x33333333) + ((x >> 2) & 0x33333333)
    x = (x + (x >> 4)) & 0x0f0f0f0f
    x = x + (x >> 8)
    x = x + (x >> 16)
    return x & 0x0000007f

N = int(input())
A = list(map(int,input().split()))
mod = 998244353
S = sum(A)
inv = pow(S,mod-2,mod)

dp = [[0 for j in range(N+1)] for i in range(2**N)]
for i in range(2**N):
    dp[i][0] = inv * A[i] % mod

for j in range(N):
    for i in range(2**N):
        if i&(1<<j):
            dp[i][j+1] = dp[i & ~(1<<j)][j] + dp[i][j]
        else:
            dp[i][j+1] = dp[i][j]

#for i in range(2**N):
    #print(dp[i][N]*S %mod)

res = 0
for i in range(2**N-1):
    res += pow(-1,N-1-popcount(i),mod) * pow(1-dp[i][N],mod-2,mod)
    res %= mod

print(res)