#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=1e9+7;
#define rep(i,a) for (int i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}



void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int N;
	cin>>N;
	vector<int> A(N);
	rep(i,N) cin>>A[i];
	int M=sqrt(N)+1;
	vector<ll> dp(N);
	vector<vector<ll>> s(M,vector<ll>(M));
	dp[0]=1;
	rep(i,N){
		if(i!=0&&A[i-1]!=1) dp[i]=(dp[i]+dp[i-1])%mod;
		rep(j,M){
			if(j==0) continue;
			dp[i]=(dp[i]+s[j][i%j])%mod;
		}
		if(A[i]<M){
			s[A[i]][i%A[i]]=(s[A[i]][i%A[i]]+dp[i])%mod;
		}else{
			for(int j=i+A[i];j<N;j+=A[i]){
				dp[j]=(dp[j]+dp[i])%mod;
			}
		}
	}
	cout<<dp[N-1]<<"\n";
}