#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;


ll gcd(ll a, ll b){
  if(b == 0) return a;
  return gcd(b,a%b);
}

template <typename T> 
struct SegmentTree {
  
  int n;
  vector<T> node;

  T f(T a, T b) {return gcd(a, b);}

  SegmentTree (int sz, T init = 0) {
    n = 1; while (n < sz) n <<= 1;
    node.assign(2*n, init);
    for (int i = n - 2; i >= 0; i--) node[i] = f(node[2*i+1], node[2*i+2]);
  }

  void update(int k, T x) {
    k += (n - 1);
    node[k] = x;
    while (k > 0) {
      k = (k - 1) >> 1;
      node[k] = f(node[2*k+1], node[2*k+2]);
    } 
  }

  T query(int a, int b, int k = 0, int l = 0, int r = -1) {
    if (r < 0) r = n;
    if (r <= a || b <= l) return 0;
    if (a <= l && r <= b) return node[k];
    T vl = query(a, b, 2*k+1, l, (l+r)/2);
    T vr = query(a, b, 2*k+2, (l+r)/2, r);
    return f(vl, vr);
  }

  T getvalue(int k) {
    return query(k,k+1);
  }
};

int main(){
  int n;
  cin >> n;
  SegmentTree<ll> seg(n);
  rep(i,n) {
    ll a;
    cin >> a;
    seg.update(i, a);
  }

  ll res = 0;
  int r = 0;
  for (int l = 0; l < n; l++) {
    if (l > r) r = l;
    while (r < n && seg.query(l, r + 1) > 1) r++;
    res += n - r;
  }
  cout << res << endl;
  return 0; 
}