#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

constexpr int FACT_SIZE = 1000000;
mint Fact[FACT_SIZE + 1];
mint iFact[FACT_SIZE + 1];
const auto fact_init = [] {
    Fact[0] = mint::raw(1);
    for(int i = 1; i <= FACT_SIZE; ++i) {
        Fact[i] = Fact[i-1] * i;
    }
    iFact[FACT_SIZE] = Fact[FACT_SIZE].inv();
    for(int i = FACT_SIZE; i; --i) {
        iFact[i-1] = iFact[i] * i;
    }
    return false;
}();

mint comb(int n, int k) {
    if (k == 0) return mint::raw(1);
    assert(n >= 0 && k >= 0);
    if (k > n) return mint::raw(0);
    return Fact[n] * iFact[n - k] * iFact[k];
}

mint icomb(int n, int k) {
    return iFact[n] * Fact[n - k] * Fact[k];
}

mint fact(int n) {return Fact[n];}
mint perm(int n, int k) {
    assert(0 <= n);
    return Fact[n] * iFact[n - k];
}

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  constexpr int mod = 999630629;
  VI a(n);
  rep(i, n) cin >> a[i];
  int sm = accumulate(all(a), 0);
  mint ans = sm * mint(2).pow(n - 1);
  int buf = sm - mod;
  if (buf >= 0) {
    vector<mint> dp(buf + 1);
    dp[0] = 1;
    sort(all(a));
    for(int i = 0; i < n;) {
      int j = i + 1;
      int d = a[i];
      while(j < n && a[j] == d) j++;
      int cnt = j - i;
      for (int i = buf - d; i >= 0; i--) if (mint v = dp[i]; v.val()) {
        for (int k = 1; k <= cnt && i + k * d <= buf; k++) {
          dp[i+k*d] += v * comb(cnt, k);
        }
      }
      i = j;
    }
    ans -= accumulate(all(dp), mint()) * mod;
  }
  cout << ans.val() << '\n';
}