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
66
67
68
69
70
#include <bits/stdc++.h>

using namespace std;

#define ALL(x) (x).begin(), (x).end()

template<class C> void mini(C &a5, C b5) { a5 = min(a5, b5); }
template<class C> void maxi(C &a5, C b5) { a5 = max(a5, b5); }

#ifdef LOCAL
const bool debug = true;
#else
const bool debug = false;
#define cerr if (true) {} else cout
#endif

#define int long long
#define double long double

const int INF = 1e18;
const int mod = 1e9 + 7;

const int max_n = 1e6 + 100;

int tab[max_n];
int pot[max_n];

const int max_a = 5000;

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    int n;
    cin >> n;
    
    vector<int> v;
    pot[0] = 1;
    for (int i = 1; i <= n; i++) {
		int a;
		cin >> a;
		v.push_back(a);
		pot[i] = (pot[i - 1] * 2) % mod;
	}
	sort(ALL(v));
	
	tab[0] = 1;
	int res = 0;
	for (int x : v) {
		n--;
		for (int i = max_a; i >= x - 1; i--) {
			if (i + x <= max_a) {
				tab[i + x] = (tab[i + x] + tab[i]) % mod;
			} else {
				res = (res + pot[n] * tab[i]) % mod;
			}
		}
	}
	
	for (int i = 1; i <= max_a; i++) {
		res += tab[i];
	}
	
	cout << res % mod;
    
    return 0;
}/*
5
2 7 4 4 1
*/