#include <bits/stdc++.h>
#include <atcoder/segtree>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;

template <class S, auto op, auto e> struct ST {
  int n = 0;
  vector<vector<S>> v;
  ST(int _n) { 
    n = _n;
    v = vector<vector<S>>(bit_width<unsigned int>(n), vector<S>(n, e()));
  }
  ST(vector<S> _v) { 
    n = _v.size();
    v = vector<vector<S>>(bit_width<unsigned int>(n), vector<S>(n, e()));
    v[0] = _v;
  }
  void set(int i, S x) { v[0][i] = x; }
  void build() {
    for (int k = 1; k < v.size(); k++) {
      for (int i = 0; i <= n-(1<<k); i++) {
        v[k][i] = op(v[k-1][i], v[k-1][i+(1<<(k-1))]);
      }
    }
  }
  S query(int l, int r) {
    if (l >= r) return e();
    int k = bit_width<unsigned>(r-l)-1;
    return op(v[k][l], v[k][r-(1<<k)]);
  }
};

ll op(ll a, ll b) { return gcd(a, b); }
ll e() { return 1; }

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);

  int n;
  cin >> n;
  ST<ll, op, e> st(n);
  for (int i = 0; i < n; i++) {
    ll x;
    cin >> x;
    st.set(i, x);
  }
  st.build();

  ll ans = 0;

  for (int i = 0; i < n; i++) {
    int l = i+1, r = n;
    while (l <= r) {
      int x = (l+r)/2;
      if (st.query(i, x) == 1) r = x-1;
      else l = x+1;
    }
    ans += n-r;
    // cout << i << ": " << n-r << "\n";
  }
  cout << ans;
}