#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>

#define mkp make_pair
#define mkt make_tuple
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
template <class T>
void chmin(T& a, const T& b) {
    if (a > b) a = b;
}
template <class T>
void chmax(T& a, const T& b) {
    if (a < b) a = b;
}

template <long long mod>
class modint {
private:
    using T = long long;
    T a;

public:
    constexpr modint(const long long x = 0) noexcept : a((x % mod + mod) % mod) {}
    constexpr T& value() noexcept {
        return a;
    }
    constexpr const T& value() const noexcept {
        return a;
    }
    constexpr modint operator-() const noexcept {
        return modint(0) -= *this;
    }
    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 {
        a += rhs.a;
        if (a >= mod) a -= mod;
        return *this;
    }
    constexpr modint& operator-=(const modint& rhs) noexcept {
        if (a < rhs.a) a += mod;
        a -= rhs.a;
        return *this;
    }
    constexpr modint& operator*=(const modint& rhs) noexcept {
        a = a * rhs.a % mod;
        return *this;
    }
    constexpr modint& operator/=(const modint& rhs) noexcept {
        return *this *= rhs.inv();
    }
    constexpr bool operator==(const modint& rhs) const noexcept {
        return a == rhs.a;
    }
    constexpr bool operator!=(const modint& rhs) const noexcept {
        return not(*this == rhs);
    }
    constexpr modint pow(long long k) const noexcept {
        modint ret(1);
        modint x = k > 0 ? *this : this->inv();
        k = abs(k);
        while (k > 0) {
            if (k & 1) ret *= x;
            x *= x;
            k >>= 1;
        }
        return ret;
    }
    constexpr modint inv() const noexcept {
        return pow(mod - 2);
    }
    friend std::ostream& operator<<(std::ostream& os, const modint& X) noexcept {
        return os << X.a;
    }
    friend std::istream& operator>>(std::istream& is, modint& X) noexcept {
        is >> X.a;
        X.a %= mod;
        if (X.a < 0) X.a += mod;
        return is;
    }
};

const int BASE = 1e4;
using mint = modint<998244353>;

void solve() {
    int N;
    cin >> N;
    vector<int> A(N);
    rep(i, N) cin >> A[i];

    vector<mint> dp(2 * BASE + 1, 0);
    dp[BASE] = 1;
    rep(i, N) {
        vector<mint> ndp(2 * BASE + 1, 0);
        rep(j, 2 * BASE + 1) {
            if (dp[j] == 0) continue;

            ndp[j - A[i]] += dp[j];
            ndp[j + A[i]] += dp[j];
        }
        swap(dp, ndp);
    }

    mint ans = 0;
    rep(j, 2 * BASE + 1) {
        if (j <= BASE)
            ans += mint(BASE - j) * dp[j];
        else
            ans += mint(j - BASE) * dp[j];
    }

    cout << ans << endl;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    solve();

    return 0;
}