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
#include <bits/stdc++.h>
using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef pair<ll, int> PILL;
typedef pair<ll, ll> PLL;

const int MAX_N = 3e5+5;
const int M = 3e4+5;
const ll INF = (ll)(1e18);
const int inf = 2e9;
const ll MOD = 1000000007LL;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
		
	int n; cin >> n;
	int totalSum = 0;
	vector<int> a(n+1);
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		totalSum += a[i];
	}
	vector<ll> dp(totalSum+1, 0LL);
	dp[0] = 1LL;
	
	sort(a.begin(), a.end());
	int maxi = 0;
	
	for (int i = 1; i <= n; i++) {
		vector<ll> newDp = dp;
		int newMaxi = maxi;
		for (int sum = a[i] - 1; sum <= maxi; sum++) {
			newDp[sum+a[i]] += dp[sum];
			newDp[sum+a[i]] %= MOD;
			newMaxi = max(newMaxi, sum + a[i]);
		}
		dp = newDp;
		maxi = newMaxi;
		/*cout << "D: " << newMaxi << '\n';
		for (ll x: dp) cout << x << ' ';
		cout << '\n';*/
	}
	
	ll ans = 0LL;
	for (int i = 1; i <= totalSum; i++) {
		ans += dp[i];
		ans %= MOD;
	}
	
	cout << ans << '\n';
	
    return 0;
}