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
#include <bits/stdc++.h>
#define int long long
#define mp make_pair
#define pb push_back
#define ld long double
#define pii pair<int,int>
#define sz(x) (int)x.size()
#define piii pair<pii,pii>
#define precise cout<<fixed<<setprecision(10)
#define st first
#define nd second
#define ins insert
#define vi vector<int>
#define BOOST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
const int MAX=5e3+5;
int dp[MAX][MAX];
int tab[MAX];
const int mod=1e9+7;
void add(int &a,int b){
  a+=b;
  while (a>=mod)a-=mod;
}
int32_t main(){
  BOOST;
  int n;
  cin>>n;
  for (int i=1;i<=n;i++)cin>>tab[i]; 
  sort(tab+1,tab+n+1);
  dp[0][0]=1;
  for (int ele=1;ele<=n;ele++){
    for (int j=MAX-1;j>=0;j--){
      add(dp[ele][j],dp[ele-1][j]);
      if (j+1<tab[ele])continue;
      add(dp[ele][min(MAX-1,tab[ele]+j)],dp[ele-1][j]);
      //if (dp[ele-1][j])cout<<"TERAZ "<<j<<" "<<tab[ele]+j<<" "<<dp[ele-1][j]<<" "<<dp[ele][tab[ele]+j]<<"\n";
    }
  }
  int ans=0;
  for (int i=1;i<MAX;i++)add(ans,dp[n][i]);
  cout<<ans;
  return 0; 
}