#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 1e6 + 5;
int dp[N][2];
int main() {
  int n, x;
  scanf("%d", &n);
  dp[0][0] = dp[0][1] = 1;
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &x);
    for (int j = 1; j * j <= x; ++j) {
      if (x % j) continue;
      dp[j][1] = (dp[j][1] + dp[j - 1][0]) % mod;
      if (j * j != x) dp[x / j][1] = (dp[x / j][1] + dp[x / j - 1][0]) % mod;
    }
    for (int j = 1; j * j <= x; ++j) {
      if (x % j) continue;
      dp[j][0] = dp[j][1] % mod;
      if (j * j != x) dp[x / j][0] = dp[x / j][1] % mod;
    }
  }
  int sum = 0;
  for (int i = 1; i <= n; ++i) {
    sum = sum + dp[i][0];
    sum %= mod;
  }
  printf("%d\n", sum);
}
