#include <algorithm> #include <deque> #include <iomanip> #include <iostream> #include <map> #include <numeric> #include <queue> #include <set> #include <string> #include <unordered_map> #include <unordered_set> #include <vector> #define all(v) (v).begin(), (v).end() #define rep(i, j) for (ll i = 0; i < j; ++i) #define rep2(i, j, k) for (ll i = j; i <= k; ++i) #define rep3(i, j, k) for (ll i = j; i >= k; --i) using namespace std; using ld = long double; using ll = long long; using pi = pair<int,int>; using pl = pair<ll,ll>; using vi = vector<int>; using vl = vector<ll>; using vpi = vector<pi>; using vpl = vector<pl>; using vvi = vector<vi>; using vvl = vector<vl>; using vvpi = vector<vpi>; using vvpl = vector<vpl>; template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>; template <class S, class T> inline bool chmax(S& x, T y) { if (x < y) { x = y; return 1; } return 0; } template <class S, class T> inline bool chmin(S& x, T y) { if (x > y) { x = y; return 1; } return 0; } constexpr int INF = 1000000000; constexpr int MAX = 5005; constexpr int MOD = 998244353; constexpr ll INFLL = 1000000000000000000; int main(void) { int n; cin >> n; vi a(n); rep(i, n) cin >> a[i]; map<int,ll> dp[n+1]; dp[0][0] = 1; rep(i, n) { for (auto [key, val] : dp[i]) { dp[i+1][key + a[i]] += val; dp[i+1][key + a[i]] %= MOD; dp[i+1][key - a[i]] += val; dp[i+1][key - a[i]] %= MOD; } } ll ans = 0; for (auto [key, val] : dp[n]) { ans += abs(key) * val % MOD; ans %= MOD; } cout << ans << endl; return (0); }