// yuki 1645 AB's abs // 2021.8.13 #include #include typedef long long ll; #define gc() getchar_unlocked() #define pc(c) putchar_unlocked(c) int in() { // 非負整数の入力 int n = 0; int c = gc(); do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0'); return n; } const int mod = 998244353; inline static int ABS(int a) { return a >= 0? a: -a; } inline static void add_mod(int *a, int b) { *a = (*a + b) % mod; } int dp[2][10010]; int N; int main() { int i, j, k0, k1; N = in();; dp[0][0] = 1, k0 = 0, k1 = 1; int s = 0; for (i = 0; i < N; ++i) { int A = in(); memset(dp[k1], 0, sizeof(dp[0])); for (j = 0; j <= s; ++j) if (dp[k0][j]) { add_mod(&dp[k1][j+A], dp[k0][j]); add_mod(&dp[k1][ABS(j-A)], dp[k0][j]); } k1 = k0, k0 = !k0; s += A; } int ans = 0; for (j = 0; j <= s; ++j) if (dp[k0][j]) { add_mod(&ans, (ll)j * dp[k0][j] % mod); } printf("%d\n", ans); return 0; }