1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
const int INF = 0x3f3f3f3f;

#define FOR(i,b,e) for(int i = (b); i < (e); i++)
#define TRAV(x,a) for(auto &x: (a))
#define SZ(x) ((int)x.size())
#define PB push_back
#define X first
#define Y second

const int N = 5e3 + 5;
const int mod = 1e9+7;

int dp[N*2] = {1};
int t[N];

void solve(){
    int n, ans = 0;
    cin >> n;
    FOR(i, 0, n) cin >> t[i];
    sort(t, t+n);
    FOR(i, 0, n){
        ans = (ans + ans) % mod;
        FOR(j, N*2-t[i], N*2) ans = (ans + dp[j]) % mod;
        for(int j = N*2 - 1; j >= 2*t[i]-1; j--){
            dp[j] = (dp[j] + dp[j-t[i]]) % mod;
        }
    }
    FOR(j, 1, N*2) ans = (ans + dp[j]) % mod;
    cout << ans << '\n';
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    // int tt; cin >> tt;
    // FOR(te, 0, tt)
    solve();
    return 0;
}