n = int(input())
A = list(map(int,input().split()))
mod = 10**9+7
x = int(n**0.5)
count = [[0]*(i+1) for i in range(x)]
dp = [0]*(n+1)
dp[0] = 1
for i,a in enumerate(A):

    for j in range(x):
        dp[i] += count[j][(i+1)%(j+1)]
        dp[i] %= mod

    if a == 1:
        count[0][0] += dp[i]
        count[0][0] %= mod

        continue
    dp[i+1] += dp[i]
    dp[i+1] %= mod
    if a <= x:
        count[a-1][(i+1)%a] += dp[i]
        count[a-1][(i+1)%a] %= mod
    else:
        for j in range(i+a,n,a):
            dp[j] += dp[i]
            dp[j] %= mod

print(dp[-2])