def isqrt(n):
    x = n
    y = (x + 1) // 2
    while y < x:
        x = y
        y = (x + n // x) // 2
    return x


N = int(input())
A = map(int, input().split())
sq = isqrt(N)
MOD = 10 ** 9 + 7

dp = [0] * N
dp[0] = 1

small_a = [[0] * i for i in range(sq)]

for i, a in enumerate(A):
    for b in range(1, sq):
        dp[i] += small_a[b][i % b]
    dp[i] %= MOD

    if i + 1 < N and a != 1:
        dp[i + 1] += dp[i]

    if sq <= a:
        for j in range(i + a, N, a):
            dp[j] += dp[i]
    else:
        small_a[a][i % a] += dp[i]
        small_a[a][i % a] %= MOD
print(dp[-1] % MOD)