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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#include <stdio.h>
#include <time.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <map> 
#include <string>
#include <vector>  
#include <iostream> 
#include <sstream> 
#include <queue>
#include <algorithm>
#include <assert.h>


using namespace std;

#define ll long long
#define PB 		push_back
#define FOR(a,start,end) 	for(int a=int(start); a<int(end); a++)
#define INF 		INT_MAX
#define SORT(a) 	sort(a.begin(),a.end()) 
#define CL(a,x) 		memset(a,x,sizeof(a))
#define REP(a,x)	for(int a=0;a<x;a++)
#define REP1(a,x)	for(int a=1;a<=x;a++)
#define MP 		make_pair



typedef vector<ll>     vi;
typedef pair<ll, ll>     pii;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vector<ll> > vvi;
typedef vector<vector<string> > vvs;
typedef vector<pair<string, string> > vss;
typedef pair<string, string> pss;
typedef pair<ll, pii> ppii;
typedef vector<ppii> vppii;
typedef vector<vector<pii> > vvii;
typedef vector<vvi> vvvi;


ll n, k, a, b, c, z, m, d, p;
vi vk, va, vb;


int main() {
	//freopen("c:\\wojtek\\uva\\pa\\debug\\t1.in", "rt", stdin);
	//cin >> c;
	//for (int cas = 0; cas < c; cas++) {
		cin >> n;
		d = 1000000007;
		va.assign(5002, 0);
		vk.assign(n, 0);
		k = 0;
		for (int i = 0; i < n; i++) {
			cin >> vk[i];
			k = max(k, vk[i]);
		}
		SORT(vk);
		z = 0;
		
		if (vk[0] == 1) {
			b = 1;
			va[1] = 1;
			for (int i = 1; i < n; i++) {
				bool jest = false;
				for (int j = b; j >=vk[i]-1; j--) {
					va[min(5001ll,j + vk[i])] += va[j];
					va[min(5001ll,j + vk[i])] %= d;
					jest = true;
				}
				if (vk[i] == 1)
					va[1]++;
				b = min(5001ll, b + vk[i]);
				if (!jest)
					break;
			}
			for (int i = 1; i <= 5001; i++) {
				z += va[i];
				z %= d; 
			}
		}
		
		cout << z << endl;
	//}
	return 0;

}