mod = 998244353
n = int(input())
s = sum(map(int,input().split()))
if n == 1:
    print(665496236)
    exit()
ans = (1-pow(pow(-3,mod-2,mod),s,mod))*(mod+1)//2%mod
print(ans)