#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = (1LL << 61);
ll mod = (ll)1e9 + 7;


signed main() {
	ll N; cin >> N;
	vector<ll>A(N); for (int i = 0; i < N; i++)cin >> A[i];
	ll sN = sqrt(N);
	vector<vector<ll>>sum(sN + 1, vector<ll>(sN + 1));
	vector<ll>dp(N);
	dp[0] = 1;
	for (int i = 0; i < N; i++) {
		if (i > 0 && A[i - 1] != 1) {
			dp[i] += dp[i - 1]; dp[i] %= mod;
		}
		for (int j = 1; j <= sN; j++) {
			dp[i] += sum[j][i%j]; dp[i] %= mod;
		}
		if (A[i] < sN) {
			sum[A[i]][i % A[i]] += dp[i];
			sum[A[i]][i % A[i]] %= mod;
		}
		else {
			for (ll j = i + A[i]; j < N; j += A[i]) {
				dp[j] += dp[i];
				dp[j] %= mod;
			}
		}
		
	}
	cout << dp[N - 1] << endl;
}