//08:36~
#include <bits/stdc++.h>
using namespace std;

template <uint32_t mod>
class modint{
    uint64_t value;
public:
    constexpr modint(const int64_t x=0) noexcept: value(x % mod + (x < 0 ? mod : 0)){ }
    constexpr explicit operator uint64_t() const noexcept{ return value; }
    constexpr modint inverse() const noexcept{ return pow(*this, mod-2); }
    constexpr bool operator==(const modint &rhs) const noexcept{ return value == rhs.value; }
    constexpr bool operator!=(const modint &rhs) const noexcept{ return value != rhs.value; }
    constexpr modint operator+() const noexcept{ return modint(*this); }
    constexpr modint operator-() const noexcept{ return modint(mod - value); }
    constexpr modint operator+(const modint &rhs) const noexcept{ return modint(*this) += rhs; }
    constexpr modint operator-(const modint &rhs) const noexcept{ return modint(*this) -= rhs; }
    constexpr modint operator*(const modint &rhs) const noexcept{ return modint(*this) *= rhs; }
    constexpr modint operator/(const modint &rhs) const noexcept{ return modint(*this) /= rhs; }
    constexpr modint &operator+=(const modint &rhs) noexcept{
        if((value += rhs.value) >= mod) value -= mod;
        return *this;
    }
    constexpr modint &operator-=(const modint &rhs) noexcept{ return *this += mod - rhs.value; }
    constexpr modint &operator*=(const modint &rhs) noexcept{
        if((value *= rhs.value) >= mod) value %= mod;
        return *this;
    }
    constexpr modint &operator/=(const modint &rhs) noexcept{ return *this *= rhs.inverse(); }
    constexpr modint operator++(int) noexcept{
        modint ret(*this);
        if((++value) >= mod) value -= mod;
        return ret;
    }
    constexpr modint operator--(int) noexcept{
        modint ret(*this);
        if((value += mod - 1) >= mod) value -= mod;
        return ret;
    }
    constexpr modint &operator++() noexcept{ return *this += 1; }
    constexpr modint &operator--() noexcept{ return *this -= 1; }
    friend std::ostream &operator<<(std::ostream &os, const modint<mod> &x){ return os << x.value; }
    friend std::istream &operator>>(std::istream &is, modint<mod> &x){
        int64_t i;
        is >> i;
        x = modint<mod>(i);
        return is;
    }
    friend constexpr modint<mod> pow(const modint<mod> &x, uint64_t y){
        modint<mod> ret{1}, m{x};
        while(y > 0){
            if(y & 1) ret *= m;
            m *= m;
            y >>= 1;
        }
        return ret;
    }
};
constexpr int64_t mod = 998244353;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int n;
    int a[300], sum[301];
    cin >> n;
    for(int i=0;i<n;++i) cin >> a[i];
    sum[0] = 0;
    for(int i=0;i<n;++i) sum[i+1] = sum[i] + a[i];

    modint<mod> ans = pow(modint<mod>{3}, n);
    static modint<mod> dp[301][300*150+1], dp2[301][300*150+2];
    dp[0][0] = 1;
    dp2[0][0] = 1;
    int kmax = (sum[n]+1)/2;
    for(int i=0;i<n;++i){
        for(int k=0;k<=kmax;++k){
            dp[i+1][k] += dp[i][k] * 2;
            dp[i+1][min(kmax, k+a[i])] += dp[i][k];
        }
    }
    for(int i=0;i<n;++i){
        for(int k=0;k<=kmax+1;++k){
            dp2[i+1][k] += dp2[i][k];
            dp2[i+1][min(kmax+1, k+a[i])] += dp2[i][k];
        }
    }
    ans -= dp[n][kmax] * 3;
    if(kmax * 2 == sum[n]) ans += dp2[n][kmax] * 3;
    cout << ans << endl;

    return 0;
}

Measured memory_bytes: 211584