#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// namespace multiprecisioninteger = boost::multiprecision;
// using cint=multiprecisioninteger::cpp_int;
using namespace std;
using ll=long long;
#define double long double
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;
#define For(i,a,b) for(i=a;i<(ll)b;++i)
#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N,0)
#define brep1(i,N) bFor(i,N,1)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define uniq(v) vsort(v);(v).erase(unique(all(v)),(v).end())
#define endl "\n"
#define eb emplace_back
#define print(x) cout<<x<<endl
#define printyes print("Yes")
#define printno print("No")
#define printYES print("YES")
#define printNO print("NO")
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)
constexpr ll mod=1000000007;
// constexpr ll mod=998244353;
constexpr ll inf=1LL<<60;
constexpr double eps=1e-9;
const double PI=acos(-1);
template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";}
template<class T> ostream& operator<<(ostream& os,const vector<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> ostream& operator<<(ostream& os,const set<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;}
template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;}
#ifdef DEBUG
void debugg(){cout<<endl;}
template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);}
#define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif

void startupcpp(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(15);
}

double distance(ddatas x,ddatas y){
  double a=x.first-y.first,b=x.second-y.second;
  return sqrt(a*a+b*b);
}

ll modinv(ll a,ll m=mod) {
  ll b=m,u=1,v=0,t;
  while(b){
    t=a/b;
    a-=t*b; swap(a,b);
    u-=t*v; swap(u,v);
  }
  return (u+m)%m;
}

ll moddevide(ll a,ll b){return (a*modinv(b))%mod;}

vec modncrlistp,modncrlistm;

ll modncr(ll n,ll r){
  if(n<r)return 0;
  ll i,size=modncrlistp.size();
  if(size<=n){
    modncrlistp.resize(n+1);
    modncrlistm.resize(n+1);
    if(!size){
      modncrlistp[0]=modncrlistm[0]=1;
      size++;
    }
    For(i,size,n+1){
      modncrlistp[i]=modncrlistp[i-1]*i%mod;
      modncrlistm[i]=modinv(modncrlistp[i]);
    }
  }
  return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;
}

ll modpow(ll a,ll n,ll m=mod){
  ll res=1;
  while(n>0){
    if(n&1)res=res*a%m;
    a=a*a%m;
    n>>=1;
  }
  return res;
}

ll gcd(ll a,ll b){if(!b)return abs(a);return (a%b==0)?abs(b):gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

ll countdigits(ll n,ll k=10){
  ll ans=0;
  while(n){n/=k;ans++;}
  return ans;
}

ll sumdigits(ll n,ll k=10){
  ll ans=0;
  while(n){ans+=n%k;n/=k;}
  return ans;
}
constexpr int bk=200;
int solve(int N,vector<int> A){
  vector<vector<int>> dp(bk+1,vector<int>(N,0));
  dp[0][0]=1;
  for(int i=0;i<N;++i){
    for(int j=1;j<=bk&&i-j>=0;++j){
      dp[j][i]=dp[j][i-j]%mod;
      (dp[0][i]+=dp[j][i])%=mod;
    }
    dp[0][i]%=mod;
    if(A[i]<=bk){
      (dp[A[i]][i]+=dp[0][i])%=mod;
    }else{
      for(int j=i+A[i];j<N;j+=A[i])(dp[0][j]+=dp[0][i])%=mod;
    }
    if(i<N-1&&A[i]!=1)(dp[0][i+1]+=dp[0][i])%=mod;
  }
  // int i;
  // print("debug");
  // rep(i,N)cout<<dp[0][i]<<" \n"[i==N-1];
  // rep(i,N)cout<<dp[1][i]<<" \n"[i==N-1];
  // rep(i,N)cout<<dp[2][i]<<" \n"[i==N-1];
  // rep(i,N)cout<<dp[3][i]<<" \n"[i==N-1];
  // rep(i,N)cout<<dp[4][i]<<" \n"[i==N-1];
  // rep(i,N)cout<<dp[5][i]<<" \n"[i==N-1];
  return dp[0][N-1];
}
ll judge(int N,vector<int> A){
  vector<int> dp2(N+1,0);
  dp2[0]=1;
  for(int i=0;i<N;++i){
    for(int j=i+A[i];j<N;j+=A[i])(dp2[j]+=dp2[i])%=mod;
    if(A[i]!=1)(dp2[i+1]+=dp2[i])%=mod;
  }
  // ll i;
  // rep(i,N)cout<<dp[i]<<" \n"[i==N-1];
  return (dp2[N-1]);
}
int main(){
  startupcpp();
  // int codeforces;cin>>codeforces;while(codeforces--){
  int i,N;
  vector<int> A;
  // debug(solve(99,{1,34,52,38,89,51,56,76,56,48,87,27,40,44,84,90,56,43,7,68,73,43,14,74,45,99,92,1,95,11,52,94,43,3,30,32,53,85,6,7,34,92,34,73,34,16,61,87,58,66,54,29,7,67,1,51,67,92,51,60,2,1,54,44,3,84,73,53,67,78,60,1,68,93,72,1,9,31,87,64,96,41,91,1,7,91,51,73,82,2,31,81,1,85,25,1,67,95,54}));
  cin>>N;
    A.resize(N);
    rep(i,N)cin>>A[i];
    print(solve(N,A));
// }
}