def main1(n,a):
  mod=10**9+7
  dp=[0]*(n+1)
  dp[1]=1
  bd=int(n**0.5)
  memo=[[0]*(bd+1) for _ in range(bd+1)]
  dp[1]=1
  num1=0
  for i in range(1,n+1):
    x=a[i-1]
    for j in range(1,bd+1):
      dp[i]+=memo[j][i%j]
      dp[i]%=mod
    dp[i]+=num1
    dp[i]%=mod
    if dp[i]==0:continue
    if i==n:break
    dp[i+1]+=dp[i]
    dp[i+1]%=mod
    if x>bd:
      now=i+x
      while now<=n:
        dp[now]+=dp[i]
        dp[now]%=mod
        now+=x
    elif x==1:
      num1+=dp[i]
      num1%=mod
      dp[i+1]-=dp[i]
    else:
      memo[x][i%x]+=dp[i]
      memo[x][i%x]%=mod
  return dp[n]

n=int(input())
a=list(map(int,input().split()))
print(main1(n,a))