#include using namespace std; constexpr int mod = 998244353; long long dp[105][20005]; int main() { int N; cin >> N; vectorA(N); dp[0][10000] = 1; for(int i = 0; i < N; i++) { cin >> A[i]; for(int j = 0; j <= 20000; j++) { if(dp[i][j] == 0) { continue; } dp[i+1][j+A[i]] += dp[i][j]; dp[i+1][j-A[i]] += dp[i][j]; } } long long ans = 0; for(int i = 0; i <= 20000; i++) { ans += abs(i-10000)*dp[N][i]%mod; ans %= mod; } cout << ans << endl; }