import java.io.*;
import java.util.*;
import java.util.function.*;
import java.util.stream.*;

public class Main {
    static final int MOD = 998244353;
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int[] counts = new int[1];
        counts[0] = 1;
        int max = 0;
        while (n-- > 0) {
            int x = sc.nextInt();
            int[] next = new int[max + x + 1];
            for (int i = 0; i <= max; i++) {
                next[i + x] += counts[i];
                next[i + x] %= MOD;
                next[Math.abs(i - x)] += counts[i];
                next[Math.abs(i - x)] %= MOD;
            }
            counts = next;
            max += x;
        }
        long ans = 0;
        for (int i = 1; i < counts.length; i++) {
            ans += (long)counts[i] * i % MOD;
            ans %= MOD;
        }
        System.out.println(ans);
    }
}
class Scanner {
    BufferedReader br;
    StringTokenizer st = new StringTokenizer("");
    StringBuilder sb = new StringBuilder();
    
    public Scanner() {
        try {
            br = new BufferedReader(new InputStreamReader(System.in));
        } catch (Exception e) {
            
        }
    }
    
    public int nextInt() {
        return Integer.parseInt(next());
    }
    
    public long nextLong() {
        return Long.parseLong(next());
    }
    
    public double nextDouble() {
        return Double.parseDouble(next());
    }
    
    public String next() {
        try {
            while (!st.hasMoreTokens()) {
                st = new StringTokenizer(br.readLine());
            }
        } catch (Exception e) {
            e.printStackTrace();
        } finally {
            return st.nextToken();
        }
    }
    
}