#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <fstream>
#include <cmath>
#include <limits>
#include <chrono>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
#include <cassert>
#pragma warning (disable: 4996)
using namespace std;

using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
    if (a < b) return euclidean_gcd(b, a);
    unsigned r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

ll ll_gcd(ll a, ll b) {
    if (a < b) return ll_gcd(b, a);
    ll r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

struct UnionFind {
    vector <ll> par;
    vector <ll> siz;
    UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    void init(ll sz_) {
        par.resize(sz_);
        siz.assign(sz_, 1LL);
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    ll root(ll x) {
        while (par[x] != x) {
            x = par[x] = par[par[x]];
        }
        return x;
    }
    bool merge(ll x, ll y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
        if (siz[x] < siz[y]) swap(x, y);
        siz[x] += siz[y];
        par[y] = x;
        return true;
    }

    bool issame(ll x, ll y) {
        return root(x) == root(y);
    }

    ll size(ll x) {
        return siz[root(x)];
    }
};

long long modpow(long long a, long long n, long long mod) {
    if (n < 0)return 0;
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

long long modinv(long long a, long long mod) {
    return modpow(a, mod - 2, mod);
}

ll merge_cnt(vector<ll>& a) {
    int n = a.size();
    if (n <= 1) { return 0; }

    ll cnt = 0;
    vector<ll> b(a.begin(), a.begin() + n / 2);
    vector<ll> c(a.begin() + n / 2, a.end());

    cnt += merge_cnt(b);
    cnt += merge_cnt(c);

    int ai = 0, bi = 0, ci = 0;
    while (ai < n) {
        if (bi < b.size() && (ci == c.size() || b[bi] <= c[ci])) {
            a[ai++] = b[bi++];
        }
        else {
            cnt += n / 2 - bi;
            a[ai++] = c[ci++];
        }
    }
    return cnt;
}


int main() {
    ll n;
    cin >> n;
    vector<ll> z(n);
    ll p = 0;
    for (int i = 0; i < n; i++) {
        cin >> z[i];
        p += z[i];
    }
    vector<ll> dp(p + 1);
    dp[0] = 1;
    for (int i = 0; i < n; i++) {
        vector<ll> dps = dp;
        for (int j = 0; j < p - z[i]+1; j++) {
            dps[j + z[i]] += dp[j] * 2;
            dps[j + z[i]] %= 998244353;
        }
        dp = dps;
    }
    ll f = 0;
    for (int i = 0; i <= p / 2; i++) {
        f += dp[i];
    }
    f %= 998244353;
    f *= -1;
    f += 998244353;
    ll ans = (modpow(3, n, 998244353) + f * 3) % 998244353;
    if (p % 2 == 0) {
        vector<ll> adp(p + 1);
        adp[0] = 1;
        for (int i = 0; i < n; i++) {
            vector<ll> dps = adp;
            for (int j = 0; j < p - z[i] + 1; j++) {
                dps[j + z[i]] += adp[j];
                dps[j + z[i]] %= 998244353;
            }
            adp = dps;
        }
        ans += adp[p / 2]*3;
        ans %= 998244353;
    }

    cout << ans << endl;
}

Measured memory_bytes: 5400