import sys
INF = float('inf')
#10**20,2**63,float('inf')
MOD = 10**9 + 7
MOD2 = 998244353
#from collections import defaultdict
def solve():
    def II(): return int(sys.stdin.readline())
    def LI(): return list(map(int, sys.stdin.readline().split()))
    def LC(): return list(input())
    def IC(): return [int(c) for c in input()]
    def MI(): return map(int, sys.stdin.readline().split())
    N = II()
    A = LI()
    DP = [[0]*11000 for _ in range(N+10)]
    DP[0][A[0]] = 2
    for a in range(1,N):
        for n in range(10010):
            DP[a][abs(n+A[a])] += DP[a-1][n]
            DP[a][abs(n+A[a])] %= MOD2
            DP[a][abs(n-A[a])] += DP[a-1][n]
            DP[a][abs(n-A[a])] %= MOD2
        #print(DP[a])
    Ans = 0
    for n in range(10010):
        Ans += n*DP[N-1][n]
        Ans %= MOD2
    print(Ans%MOD2)
    return
solve()
#sys.setrecursionlimit(10 ** 6)#再帰関数ではコメントにしないこと！！