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;
using LL = long long;
using D = double;
#define f1 first
#define f2 second
#define randint(a, b) uniform_int_distribution<int>{a, b}(gen)
#ifdef LOC
void OUT() {cout << '\n';}
template<class H, class ... T> void OUT(H h, T ... t)
{
	cout << h << ' ';
	OUT(t...);
}
#define P(...) cout << "[" << #__VA_ARGS__ << "] ", OUT(__VA_ARGS__)
#else
#define P(...)
#define OUT(...)
#endif
//mt19937 gen;
vector<int> dp[2];
const int MMOD = 1e9 + 7;
int add(int a, int b) {a += b; if(a >= MMOD) a -= MMOD;
 return a;}
const int maxDp = 5010;
int main(int, char ** /*args*/)
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	dp[0].resize(maxDp, 0);
	dp[1].resize(maxDp, 0);
	int n;
	cin >> n;
	vector<int> val;
	val.reserve(n);
	for(int i = 0; i < n; ++i)
	{
		int a;
		cin >> a;
		val.push_back(a);
	}
	sort(val.begin(), val.end());
	dp[0][0] = 1;
	dp[1][0] = 1;
	for(auto pp : val)
	{
		for(int i = maxDp - 1; i >= pp - 1; --i)
		{
			auto & t = dp[1][min(maxDp - 1, i + pp)];
			t = add(t, dp[0][i]);
		}
		swap(dp[0], dp[1]);
		for(int i = 0; i < maxDp; ++i) dp[1][i] = dp[0][i];
		//for(int i = 0; i < 20; ++i) cout << dp[0][i] << ' ';
		//cout << '\n';
	}
	int ans = MMOD - 1;
	for(int i = 0; i < maxDp; ++i)
	{
		ans = add(ans, dp[0][i]);
	}
	cout << ans << '\n';
	//gen.seed(atoi(args[1]));
	return 0;
}