#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1000000007;
signed main(){
  int N;cin>>N;
  int S=sqrt(N);
  vector<int>dp(N);dp[0]=1;
  vector<vector<int>>A(S,vector<int>(S));
  for(int i=0;i<N-1;i++){
    int a;cin>>a;
    if(a<S){
      A[a][i%a]=(dp[i]+A[a][i%a])%mod;
    }else{
      for(int j=i+a;j<N;j+=a)dp[j]=(dp[j]+dp[i])%mod;
    }
    if(a!=1)dp[i+1]=(dp[i+1]+dp[i])%mod;
    for(int j=1;j<S;j++)dp[i+1]=(dp[i+1]+A[j][(i+1)%j])%mod;
  }
  cout<<dp[N-1]<<endl;
}