# import sys
# #sys.setrecursionlimit(1000000)
# input = sys.stdin.readline
def mp():return map(int,input().split())
def lmp():return list(map(int,input().split()))
import math
import bisect
from copy import deepcopy as dc
from itertools import accumulate
from collections import Counter, defaultdict, deque
import itertools
def ceil(U,V):return (U+V-1)//V
def modf1(N,MOD):return (N-1)%MOD+1
inf = int(1e30)
mod = 998244353

n = int(input())
a = lmp()
dp = [[0]*21000 for i in range(n)]
dp[0][a[0]] = 1
dp[0][-a[0]] = 1
for i in range(n-1):
    for j in range(-10000,10001, 1):
        dp[i+1][j+a[i+1]] += dp[i][j]
        dp[i+1][j-a[i+1]] += dp[i][j]
ans = 0
for i in range(10001):
    ans += i*dp[-1][i]
print(ans*2 % mod)