### BUGGY CODE ###

from math import ceil


def solve():
    # 入力
    N = int(input())
    A = [int(input()) for i in range(N)]

    MOD = 998244353

    class ModInt:
        def __init__(self, x):
            self.x = x % MOD

        def __str__(self):
            return str(self.x)

        __repr__ = __str__

        def __add__(self, other):
            return (
                ModInt(self.x + other.x) if isinstance(other, ModInt) else
                ModInt(self.x + other)
            )

        def __sub__(self, other):
            return (
                ModInt(self.x - other.x) if isinstance(other, ModInt) else
                ModInt(self.x - other)
            )

        def __mul__(self, other):
            return (
                ModInt(self.x * other.x) if isinstance(other, ModInt) else
                ModInt(self.x * other)
            )

        def __truediv__(self, other):
            return (
                ModInt(
                    self.x * pow(other.x, MOD - 2, MOD)
                ) if isinstance(other, ModInt) else
                ModInt(self.x * pow(other, MOD - 2, MOD))
            )

        def __pow__(self, other):
            return (
                ModInt(pow(self.x, other.x, MOD)) if isinstance(other, ModInt) else
                ModInt(pow(self.x, other, MOD))
            )

        __radd__ = __add__

        def __rsub__(self, other):
            return (
                ModInt(other.x - self.x) if isinstance(other, ModInt) else
                ModInt(other - self.x)
            )

        __rmul__ = __mul__

        def __rtruediv__(self, other):
            return (
                ModInt(
                    other.x * pow(self.x, MOD - 2, MOD)
                ) if isinstance(other, ModInt) else
                ModInt(other * pow(self.x, MOD - 2, MOD))
            )

        def __rpow__(self, other):
            return (
                ModInt(pow(other.x, self.x, MOD)) if isinstance(other, ModInt) else
                ModInt(pow(other, self.x, MOD))
            )

    S = sum(A)
    # 赤色の整数の和がiとなるような塗り方の個数
    dp = [ModInt(0) for _ in range(S + 1)]
    dp[0] = ModInt(1)
    # 赤色の整数の和がi, 他の整数がすべて青色となるような塗り方の個数
    dp2 = [ModInt(0) for _ in range(S // 2 + 1)]
    dp2[0] = ModInt(1)

    # 動的計画法により、dp, dp2を求める
    for a in A:
        for i in range(S, a - 1, -1):
            dp[i] = dp[i] * 2 + dp[i - a]
        for i in range(a - 1, -1, -1):
            dp[i] = dp[i] * 2
        for i in range(S // 2, a - 1, -1):
            dp2[i] = dp2[i] + dp2[i - a]

    # 全ての塗り方の個数から、条件を満たさない塗り方の個数を差し引いて解を求める
    ans = 3**N - 3 * sum(dp[ceil(S / 2):]) + (
        3 * dp2[S // 2] if S % 2 == 0 else
        0
    )

    # 出力
    print(ans)


solve()


### FIXED CODE ###

N = int(input())
A = [int(input()) for i in range(N)]

M = 998244353

S = sum(A)
dp = [0 for _ in range(S + 1)]
dp[0] = 1
for a in A:
    for i in range(S, a - 1, -1):
        dp[i] = (2 * dp[i] + dp[i - a]) % M
    for i in range(a - 1, -1, -1):
        dp[i] = (2 * dp[i]) % M
dp2 = [0 for _ in range(S + 1)]
dp2[0] = 1
for a in A:
    for i in range(S, a - 1, -1):
        dp2[i] = (dp2[i] + dp2[i - a]) % M
s = 0
for i in range((S + 1) // 2, S + 1):
    s = (s + dp[i]) % M
ans = (3**N - 3 * s) % M
if S % 2 == 0:
    ans = (3**N - 3 * s + 3 * dp2[S // 2]) % M
print(ans)