import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum long MO = 998244353;

int N;
int[] A;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      A = new int[N];
      foreach (i; 0 .. N) {
        A[i] = readInt();
      }
      
      const ASum = A.sum;
      auto dp = new long[][][](N + 1, 4, ASum + 1);
      dp[0][0][0] = 1;
      foreach (i; 0 .. N) {
        foreach (x; 0 .. ASum + 1) {
          foreach (p; 0 .. 4) {
            if (x + A[i] <= ASum) {
              dp[i + 1][p][x + A[i]] += dp[i][p][x];
              dp[i + 1][p][x + A[i]] %= MO;
            }
            dp[i + 1][p | 1][x] += dp[i][p][x];
            dp[i + 1][p | 1][x] %= MO;
            dp[i + 1][p | 2][x] += dp[i][p][x];
            dp[i + 1][p | 2][x] %= MO;
          }
        }
      }
      debug {
        writeln(dp[N][3]);
      }
      
      long two = 1, three = 1;
      foreach (i; 0 .. N) {
        two *= 2;
        two %= MO;
        three *= 3;
        three %= MO;
      }
      long ans = three - 3 * two + 3;
      foreach (x; 0 .. ASum + 1) {
        if (x >= ASum - x) {
          ans -= 3 * dp[N][3][x];
          ans %= MO;
        }
      }
      ans = (ans % MO + MO) % MO;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
