#include <bits/stdc++.h>

#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT_ON(bit, i) (((bit >> i) & 1) > 0)

typedef long long LL;
template<typename T> std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts> auto make_v(size_t a, Ts... ts){ return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}    // C++14
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
template<class T> inline void print(T x) { std::cout << x << std::endl; }
template<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) {  if (i != 0) {std::cout << " ";} std::cout << v[i];} std::cout << "\n"; }
template<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }
template<typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }

template<class T> inline std::vector<T> unique(std::vector<T> v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    return v;
}
// 初項s, 交差dのn個の数列の和
long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
    return n * (2 * s + (n - 1) * d) / 2;
}

const int INF = 1 << 30;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy4 = {0, -1, 0, 1}, dx4 = {1, 0, -1, 0};
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };


using namespace std;
const LL MOD = 998244353;

long long powmod(long long base, long long exp, long long mod) {
    long long x = 1, y = base;
    while (exp > 0) {
        if (exp % 2 == 1) {
            x = (x * y) % mod;
        }
        y = (y * y) % mod;
        exp /= 2;
    }

    return x % mod;
}

LL func1(int S, int maxi, const std::vector<int> &v) {
    const int n = v.size();
    std::vector<vector<LL>> dp(n + 1, vector<LL>(maxi + 10, 0));
    dp[0][0] = 1;
    for (int i = 0; i < v.size(); ++i) {
        for (int j = 0; j < dp[0].size(); ++j) {
            if (dp[i][j] == 0) {
                continue;
            }

            if (j + v[i] < dp[0].size()) {
                (dp[i + 1][j + v[i]] += dp[i][j]) %= MOD;
            }
            (dp[i + 1][j] += 2 * dp[i][j]) %= MOD;
        }

    }

    LL total = 0;
    FOR(j, S, dp[0].size()) {
        (total += dp[n][j]) %= MOD;
    }
    return total;
}

LL func2(int S, const std::vector<int> &v) {
    const int n = v.size();
    std::vector<std::vector<LL>> dp(n + 1, vector<LL>(S + 10, 0));
    dp[0][0] = 1;

    for (int i = 0; i < v.size(); ++i) {
        for (int j = 0; j < dp[0].size(); ++j) {
            if (dp[i][j] == 0) {
                continue;
            }
            if (j + v[i] <= S) {
                (dp[i + 1][j + v[i]] += dp[i][j]) %= MOD;
            }
            (dp[i + 1][j] += dp[i][j]) %= MOD;
        }
    }

    return dp[n][S];
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N;
    cin >> N;
    auto A = make_v<int>(N);
    LL total = 0;
    FOR(i, 0, N) {
        cin >> A[i];
        total += A[i];
    }

    LL a = (func1(ceil(total, 2LL), total, A)) * 3 % MOD;
    LL b = 0;
    if (total % 2 == 0) {
        b = (func2(total / 2LL, A) * 3) % MOD;
    }

    LL ans = powmod(3, N, MOD);
    ans = (ans + MOD - a) % MOD;
    ans = (ans + b) % MOD;

    print(ans);

    return 0;
}



Measured memory_bytes: 212864