#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;

int main(){
  int n;
  cin >> n;
  vector<int> a(n);
  rep(i, n) cin >> a[i];

  auto GCD = [&](auto& f, int a, int b) -> int{
    if (b == 0) return a;
    return f(f,b,a%b);
  };
  vector<map<int, ll>> dp(n);
  ll res = 0;
  for (int i = 0; i < n; i++) {
    dp[i][a[i]]++;
    for (int j = i + 1; j < n; j++) {
      for (auto e : dp[i]) dp[j][GCD(GCD, a[j], e.first)] += e.second;
    }
    res += dp[i][1];
  }
  cout << res << endl;
  return 0;
}