import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")

n = int(input())
a = list(map(int, input().split()))
M = 998244353

### 素数の逆元とCombination

N = 104 # 必要なテーブルサイズ
g1 = [None] * (N+1) # 元テーブル
g2 = [None] * (N+1) #逆元テーブル
inverse = [None] * (N+1) #逆元テーブル計算用テーブル
g1[0] = g1[1] = g2[0] = g2[1] = 1
inverse[0], inverse[1] = [0, 1] 
for i in range( 2, N + 1 ):
    g1[i] = ( g1[i-1] * i ) % M 
    inverse[i] = ( -inverse[M % i] * (M//i) ) % M # ai+b==0 mod M <=> i==-b*a^(-1) <=> i^(-1)==-b^(-1)*aより
    g2[i] = (g2[i-1] * inverse[i]) % M 
def cmb(n, r, M):
    if ( r<0 or r>n ):
        return 0
    r = min(r, n-r)
    return (g1[n] * g2[r] * g2[n-r]) % M
def perm(n, r, M):
    if (r<0 or r>n):
        return 0
    return (g1[n] * g2[n-r]) % M

ps = [0]*n
for b in range(1<<n):
    for i in range(n):
        if b>>i&1:
            ps[i] += a[b]
total = sum(a)
tinv = pow(total, M-2, M)
for i in range(n):
    ps[i] = ps[i] * tinv
    ps[i] %= M
ans = 0
for b in range(1,(1<<n)-1):
    s = bin(b).count("1")
    si = -1
    val = 1
    for i in range(n):
        if b>>i&1:
            si *= -1
            val *= (1 - ps[i])
            val %= M
    ans += val * si * pow(1-val, M-2, M)
print(ans%M)