import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [[(-1, 0), (1, 0)], [(0, -1), (0, 1)]]
inf = 10**16
# md = 998244353
md = 10**9+7

n = II()
aa = LI()
dp = [0]*(n+1)
dp[0] = 1
bb = [[0]*101 for _ in range(101)]
fin = set()
for i, a in enumerate(aa):
    for m in fin:
        dp[i] += bb[m][i%m]
        dp[i] %= md
    pre = dp[i]
    if pre == 0: continue
    if a > 100:
        for j in range(i+a, n+1, a):
            dp[j] += pre
            dp[j] %= md
    else:
        fin.add(a)
        bb[a][i%a] += pre
        bb[a][i%a] %= md
    if a > 1:
        dp[i+1] += pre
        dp[i+1] %= md

print(dp[n-1]%md)