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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
#include <bits/stdc++.h>

using namespace std;

typedef vector<int> VI;
typedef long long LL;
#define FOR(x, b, e) for(int x = b; x<= (e); ++x)
#define FORD(x, b, e) for(int x = b; x>= (e); --x)
#define REP(x, n) for(int x = 0; x<(n); ++x)
#define VAR(v, n)typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB pushback
#define ST first
#define ND second

const int p = 1000000007;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n;
    cin >> n;

    int a[n];
    FOR(i, 0, n - 1) {
        cin >> a[i];
    }

    sort(a, a + n);

    int S[5001];
    int result = 0;

    if (a[0] == 1) {
        S[0] = 1;
        S[1] = 1;
        FOR(i, 2, 5000) {
            S[i] = 0;
        }

        FOR(i, 1, n - 1) {
            S[5000] = (2*S[5000]) % p;
            FOR(j, max(5000 - a[i], a[i] - 1), 4999) {
                S[5000] = (S[5000] + S[j]) % p;
            }
            if (a[i] <= 2500) {
                FORD(j, 4999, 2*a[i] - 1) {
                    S[j] = (S[j] + S[j - a[i]]) % p;
                }
            }
        }

        FOR(i, 1, 5000) {
            result = (result + S[i]) % p;
        }
    }

    cout << result << "\n";

    return 0;
}