from collections import *
from itertools import *
from functools import *
from heapq import *
import sys,math
input = sys.stdin.readline

N = int(input())
A = [0]+list(map(int,input().split()))

mod = 10**9 + 7

B = math.ceil(math.sqrt(N))
S = [[0]*(B+1) for _ in range(B)]
dp = [0]*(N+1)

dp[1] = 1
a = A[1]
if a>B:
    for i in range(1+a,N+1,a):
        dp[i] = (dp[i]+dp[1])%mod
else:
    S[1%a][a] = (S[1%a][a] + dp[1])%mod
    
for i in range(2,N+1):
    
    if A[i-1]!=1:
        dp[i] = (dp[i]+dp[i-1])%mod
    
    for j in range(1,B+1):
        dp[i] = (dp[i] + S[i%j][j])%mod
    
    a = A[i]
    if a>B:
        for j in range(i+a,N+1,a):
            dp[j] = (dp[j]+dp[i])%mod
    else:
        S[i%a][a] = (S[i%a][a] + dp[i])%mod
print(dp[-1])