## https://yukicoder.me/problems/no/1331

import math

MOD = 10 ** 9 + 7    

def main():
    N = int(input())
    A = list(map(int, input().split()))

    dp = [0] * (N + 1)
    dp[1] = 1

    sqrt_n = int(math.sqrt(N))
    mods = [[0] * (max(1, a)) for a in range(sqrt_n + 1)]
    for p in range(1, N + 1):
        a = A[p - 1]
        for n in range(1, sqrt_n + 1):
            dp[p] += mods[n][p % n]
            dp[p] %= MOD

        if p < N and a > 1:
            dp[p + 1] += dp[p]
            dp[p + 1] %= MOD

        if a > sqrt_n:
            x = p + a
            while x <= N:
                dp[x] += dp[p]
                dp[x] %= MOD
                x += a
        else:
            mods[a][p % a] += dp[p]
            mods[a][p % a] %= MOD

    print(dp[-1])








if __name__ == "__main__":
    main()