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
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("sse,sse2,mmx,abm")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")
typedef long long lld;
typedef double lf;
typedef long double llf;
typedef pair<int,int> pii;
typedef pair<lld,lld> pll;
#define For(i,s,a) for(int i = (int)s; i < (int)a; ++i)
#define rpt(s, it) for(auto it = s.begin(); it != s.end(); ++it)
#define brpt(s, it) for(auto it = s.rend(); it != s.rbegin(); --it)
#define sz size()
#define pb push_back
#define eb emplace_back
#define ff first
#define dd second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define ZAPS {int t; scanf("%i", &t); while(t--) solve();}
#define make_unique(x) (x).erase( unique(all(x)), (x).end())


template<typename Ta, typename Tb>
ostream & operator <<(ostream & os, pair<Ta, Tb> x){
	return os << x.ff << " " << x.dd;
}

lld dp[5001];
const int N = 5001;
const lld p = 1e9 + 7;
int c[5001];

int32_t main(void){
	int n;
	scanf("%d", &n);
	For(i, 0, n)
		scanf("%d", &c[i]);
	sort(c, c + n);
	lld sum = 0, nxt = 0;
	For(x, 0, n){
		int bag = c[x];
		for(int pre = 5000; pre > bag - 2; --pre){
			if(pre + bag < 5001)
				(dp[pre + bag] += dp[pre]) %= p;
			else
				(nxt += dp[pre]) %= p;
		}
		nxt += sum;
		sum = nxt % p;
		if(bag == 1)
			++dp[1];
	}
	For(i, 0, 5001)
		sum += dp[i];
	printf("%lld", sum % p);
}

/*
5
2 7 4 4 1
*/