#include <bits/stdc++.h>
#include <unistd.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}


typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
//const ll MOD = 1000000007;
const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { -1,0, 1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
//#define mp make_pair


ll mod_pow(ll x, ll p, ll M = MOD) {
  ll a = 1;
  while (p) {
    if (p % 2)
      a = a*x%M;
    x = x*x%M;
    p /= 2;
  }
  return a;
}

ll mod_inverse(ll a, ll M = MOD) {
  return mod_pow(a, M - 2, M);
}


int main() {
  int n;
  cin >> n;
  vi a(n);
  int sum = 0;
  rep (i, n) {
    cin >> a[i];
    sum += a[i];
  }

  int m = 100000;
  vll dp(n + 1, vl(m + 1));
  dp[0][0] = 1;
  rep (i, n) {
    rep (j, m) {
      if (dp[i][j] == 0) continue;
      (dp[i + 1][j + a[i]] += dp[i][j]) %= MOD;
      (dp[i + 1][j] += dp[i][j] * 2 % MOD) %= MOD;
    }
  }
  //DEBUG_MAT(dp);
  
  ll dame = 0;
  ll zs = 0;
  for (int i = 0; i <= m; i++) {
    int r = i, no = sum - i;
    if (i > sum) break;
    if (r < no) continue;
    (dame += dp[n][r]) %= MOD;
  }

  dame = dame * 3 % MOD;

  if (sum % 2 == 0) {
    vll dp2(n + 1, vl(m + 1));
    dp2[0][0] = 1;
    rep (i, n) {
      rep (j, m) {
        if (dp2[i][j] == 0) continue;
        (dp2[i + 1][j + a[i]] += dp2[i][j]) %= MOD;
        (dp2[i + 1][j] += dp2[i][j]) %= MOD;
      }
    }

    (dame -= dp2[n][sum / 2] * 3 % MOD) %= MOD;
  }
  ll zen = mod_pow(3, n);
  ll ans = (zen - dame) % MOD;
  ans = (ans + MOD) % MOD;
  cout << ans << endl;
}


Measured memory_bytes: 472176