#include <stdio.h>

const int Mod = 998244353, Modd = 999630629;

long long pow_mod(int n, long long k)
{
	long long N, ans = 1;
	for (N = n; k > 0; k >>= 1, N = N * N % Mod) if (k & 1) ans = ans * N % Mod;
	return ans;
}

void merge_sort(int n, int x[])
{
	static int y[100001] = {};
	if (n <= 1) return;
	merge_sort(n / 2, &(x[0]));
	merge_sort((n + 1) / 2, &(x[n/2]));
	
	int i, p, q;
	for (i = 0, p = 0, q = n / 2; i < n; i++) {
		if (p >= n / 2) y[i] = x[q++];
		else if (q >= n) y[i] = x[p++];
		else y[i] = (x[p] < x[q])? x[p++]: x[q++];
	}
	for (i = 0; i < n; i++) x[i] = y[i];
}

int main()
{
	int i, N, A[100001], sum = 0;
	scanf("%d", &N);
	for (i = 0; i < N; i++) {
		scanf("%d", &(A[i]));
		sum += A[i];
	}
	merge_sort(N, A);
	
	static int dp[2][370000] = {}, q[2][370000];
	int j, tmp, cur, prev, head, tail, M = sum - Modd;
	long long ans = sum * pow_mod(2, N - 1) % Mod;
	if (M >= 0) {
		q[0][0] = 0;
		dp[0][0] = 1;
		tail = 1;
		for (i = N - 1, cur = 1, prev = 0; i >= 0; i--, cur ^= 1, prev ^= 1) {
			for (head = tail - 1, tail = 0; head >= 0; head--) {
				j = q[prev][head];
				tmp = dp[prev][j];
				dp[prev][j] = 0;
				
				if (dp[cur][j] == 0) q[cur][tail++] = j;
				dp[cur][j] += tmp;
				if (dp[cur][j] >= Mod) dp[cur][j] -= Mod;
				j += A[i];
				if (j <= M) {
					if (dp[cur][j] == 0) q[cur][tail++] = j;
					dp[cur][j] += tmp;
					if (dp[cur][j] >= Mod) dp[cur][j] -= Mod;
				}
			}
		}
		for (j = 0; j <= M; j++) ans += (long long)(Mod - dp[prev][j]) * Modd % Mod;
	}
	printf("%lld\n", ans % Mod);
	fflush(stdout);
	return 0;
}