#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;

//template
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
using ll=long long int;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}

template<int mod=1000000007>struct fp {
   int v; static int get_mod(){return mod;}
   int inv() const{
      int tmp,a=v,b=mod,x=1,y=0;
      while(b)tmp=a/b,a-=tmp*b,swap(a,b),x-=tmp*y,swap(x,y);
      if(x<0){x+=mod;} return x;
   }
   fp(ll x=0){init(x%mod+mod);}
   fp& init(int x){v=(x<mod?x:x-mod); return *this;}
   fp operator-()const{return fp()-*this;}
   fp pow(ll t){fp res=1,b=*this; while(t){if(t&1)res*=b;b*=b;t>>=1;} return res;}
   fp& operator+=(const fp& x){return init(v+x.v);}
   fp& operator-=(const fp& x){return init(v+mod-x.v);}
   fp& operator*=(const fp& x){v=ll(v)*x.v%mod; return *this;}
   fp& operator/=(const fp& x){v=ll(v)*x.inv()%mod; return *this;}
   fp operator+(const fp& x)const{return fp(*this)+=x;}
   fp operator-(const fp& x)const{return fp(*this)-=x;}
   fp operator*(const fp& x)const{return fp(*this)*=x;}
   fp operator/(const fp& x)const{return fp(*this)/=x;}
   bool operator==(const fp& x)const{return v==x.v;}
   bool operator!=(const fp& x)const{return v!=x.v;}
   friend istream& operator>>(istream& is,fp& x){ll t; is>>t; x=init(t); return is;}
   friend ostream& operator<<(ostream& os,const fp& x){os<<x.v; return os;}
}; using Fp=fp<>;
template<typename T>struct factorial {
   vector<T> Fact,Finv,Inv;
   factorial(int maxx){
      Fact.resize(maxx); Finv.resize(maxx); Inv.resize(maxx);
      Fact[0]=Fact[1]=Finv[0]=Finv[1]=Inv[1]=1;
      rep(i,2,maxx){Fact[i]=Fact[i-1]*i;} Finv[maxx-1]=Fact[maxx-1].inv();
      for(int i=maxx-1;i>=2;i--){Finv[i-1]=Finv[i]*i; Inv[i]=Finv[i]*Fact[i-1];}
   }
   T fact(int n,bool inv=0){if(n<0)return 0; return (inv?Finv[n]:Fact[n]);}
   T inv(int n){if(n<0)return 0; return Inv[n];}
   T nPr(int n,int r,bool inv=0){if(n<0||n<r||r<0)return 0; return fact(n,inv)*fact(n-r,inv^1);}
   T nCr(int n,int r,bool inv=0){if(n<0||n<r||r<0)return 0; return fact(n,inv)*fact(r,inv^1)*fact(n-r,inv^1);}
   T nHr(int n,int r,bool inv=0){return nCr(n+r-1,r,inv);}
};

Fp dp[3010][3010],dp2[3010][3010];

int main(){
   int n;
   cin>>n;
   vector<ll> a(n);
   rep(i,0,n)cin>>a[i];

   dp[0][0]=dp2[0][0]=1;
   ll sum=0;
   rep(i,0,n){
      sum+=a[i];
      rep(x,1,n+1)dp[i+1][x]+=dp2[x-1][sum%x];
      rep(x,1,n+1)dp2[x][sum%(x+1)]+=dp[i+1][x];
   }
   Fp res;
   rep(x,1,n+1)res+=dp[n][x];
   cout<<res<<'\n';
   return 0;
}
#include<bits/stdc++.h>

using namespace std;

#define sz(x) (ll)((x).size())
typedef long long int ll;
typedef long double ld;

const ll INF=1e9;
const ll INFF=1e18;
const ll M=1e9+7;

void solve(){
    ll n;
    cin>>n;
    vector<ll> v(n+1),pre(n+1);
    vector<vector<ll>> dp(n+1,vector<ll>(n+1)),needed(n+1,vector<ll>(n+1));;
    for(int i=1;i<=n;i++){
        cin>>v[i];
        pre[i]=pre[i-1]+v[i];
    }
    needed[1][0]=1;
    for(int i=1;i<=n;i++){
        for(int numP=1;numP<=n;numP++){
            dp[i][numP]=needed[numP][pre[i]%numP];
        }
        for(int numP=1;numP<=n;numP++){
            (needed[numP][pre[i]%numP]+=dp[i][numP-1])%=M;
        }
    }
    ll ans=0;
    for(int i=1;i<=n;i++){
        (ans+=dp[n][i])%=M;
    }
    cout<<ans;
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    int t=1;
    //cin>>t;
    int tt=t;
    while(t--){
        //cout<<"Case #"<<tt-t<<": ";
        solve();
    }
    return 0;
}