#include<bits/stdc++.h>
// #include<atcoder/all>
using namespace std;
// using namespace atcoder;
using lint = long long;
#define endl '\n'
lint const mod = 1e9+7;
//long const mod = 998244353;


int main(){
    int n;
    cin >> n;
    int a[n];
    for(int i=0;i<n;i++)cin >> a[i];
    vector<lint>dp(n);
    dp[0] = 1;
    vector<vector<int>>sum(n,vector<int>(1000));
    for(int i=0;i<n;i++){
        for(int j=1;j<1000;j++){
            dp[i] += sum[i%j][j];
            dp[i] %= mod;
        }
        if(i == n-1)break;
        if(a[i] != 1)dp[i+1] += dp[i];
        if(a[i] < 1000){
            sum[i%a[i]][a[i]] += dp[i];
            sum[i%a[i]][a[i]] %= mod;
        }else{
            for(int j = i + a[i]; j<n; j+=a[i]){
                dp[j] += dp[i];
            }
        }
        
    }
    cout << dp[n-1] << endl;
}