#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) FOR(i, 0, (n))
#define FOR(i, a, b) for(int i=(a); i<(b); i++)
#define LAR(a, b) ((a)=max((a),(b)))
#define SML(a, b) ((a)=min((a),(b)))
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;
template<typename T>
using pque = priority_queue<T, vector<T>, greater<T>>;
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define ALL(a) (a).begin(), (a).end()
#ifdef LOCAL_DEBUG
#define DEBUG(...) printf(__VA_ARGS__)
#else
#define DEBUG(...)
#endif

#define MOD 1'000'000'007LL
#define N 112345
#define M 316

int a[N];
ll b[M][M];
ll c[N] = {};

int main(){
	int n; scanf("%d", &n);
	REP(i, n) scanf("%d", a+i);
	for(int i = n-1; i >= 0; i--){
		if(i == n-1) {
			c[i] = 1;
		} else if(a[i] >= M){
			c[i] += c[i+1];
			for(int j = i+a[i]; j < n; j += a[i]) c[i] += c[j];
		} else {
			if(a[i] > 1) c[i] += c[i+1];
			c[i] += b[a[i]][i%a[i]];
		}
		c[i] %= MOD;
		FOR(j, 1, M) b[j][i%j] = (b[j][i%j] + c[i]) % MOD;
	}
	printf("%lld\n", c[0]);
}