import sys
input = lambda : sys.stdin.readline().rstrip()

sys.setrecursionlimit(2*10**5+10)
write = lambda x: sys.stdout.write(x+"\n")
_print = lambda *x: print(*x, file=sys.stderr)

n = int(input())
a = list(map(int, input().split()))
B = min(300, max(a)+1)
dp = [0]*(n)
dp[0] = 1
M = 10**9+7
vals = [[0]*B for _ in range(B)]
def sub(i):
    res = 0
    for v in range(1,B):
        res += vals[v][i%v]
        res %= M
    return res
#     return sum(vals[v][i%v] for v in range(1,B))%M
for i,v in enumerate(a):
    dp[i] += sub(i)
    if i==n-1:
        break
    if v>=2:
        dp[i+1] += dp[i]
    if v>=B:
        for j in range(i+v,n,v):
            dp[j] += dp[i]
            dp[j] %= M
    else:
        vals[v][i%v] += dp[i]
        vals[v][i%v] %= M
ans = dp[-1]%M
print(ans%M)