spf = [i for i in range(10**5)]
for i in range(2,10**5):
    if spf[i]!=i:
        continue
    for j in range(2*i,10**5,i):
        spf[j] = i

def factorization(n):
    res = []
    for i in range(2,n+1):
        if i**2 > n:
            break
        if n%i==0:
            assert spf[i]==i
            cnt = 0
            while n%i==0:
                cnt += 1
                n //= i
            res.append((i,cnt))
    if n!=1:
        res.append((n,1))
    return res

def divisors(n):
    res = []
    for i in range(2,n+1):
        if i**2 >= n:
            break
        if n%i==0:
            res.append(i)
            res.append(n//i)
    if i**2==n:
        res.append(i)
    return res

import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import gcd,log

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

mod = 998244353

N = int(input())
A = li()

S = sum(A)
dp = [0 for i in range(-S,S+1)]
dp[0] = 1
for i in range(N):
    ndp = [0 for i in range(-S,S+1)]
    for val in range(-S,S+1):
        if not dp[val]:
            continue
        ndp[val+A[i]] += dp[val]
        ndp[val+A[i]] %= mod
        ndp[val-A[i]] += dp[val]
        ndp[val-A[i]] %= mod

    dp = ndp


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

print(res)