#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class Operator> class SparseTable{
public:
	Operator Op;                           
	using typeNode = decltype(Op.unitNode);
	vector<typeNode> node;
	vector<int> idx;
	size_t depth;
	size_t length;

	SparseTable(const vector<typeNode>& vec) {
		for(depth = 0;(1<<depth)<=vec.size();++depth);
		length = (1<<depth);
		node.resize(depth*length);
		for(int i = 0; i < vec.size(); ++i) node[i] = vec[i];
		for(int i = 1; i < depth; ++i) for(int j = 0; j + (1<<i) < (1<<depth); ++j) node[i*length+j] = Op.funcNode(node[(i-1)*length+j],node[(i-1)*length+j + (1 << (i-1))]);
		idx.resize(vec.size()+1);
		for(int i = 2; i < vec.size()+1; ++i) idx[i] = idx[i>>1] + 1;
	}

	//[l,r)
	typeNode get(int l,int r) {
		return Op.funcNode(node[idx[r-l]*length+l],node[idx[r-l]*length+r - (1<<idx[r-l])]);
	}
};

//verify https://atcoder.jp/contests/joi2016ho/tasks/joi2016ho_a

	// function<ll(ll,ll)> funcNode1 = [&](ll l,ll r){return min(l,r);};
	// function<ll(ll,ll)> funcNode2 = [&](ll l,ll r){return max(l,r);};
	// SparseTable<ll> stMin(A,funcNode1),stMax(A,funcNode2);



static inline long long gcd_impl(long long n, long long m) {
  constexpr long long K = 5;
  for(int i = 0; i < 80; ++i) {
    long long t = n - m;
    long long s = n - m * K;
    bool q = t < m;
    bool p = t < m * K;
    n = q ? m : t;
    m = q ? t : m;
    if(m == 0) { return n; }
    n = p ? n : s;
  }
  return gcd_impl(m, n % m);
}

static inline long long gcd_pre(long long n, long long m) {
  for(int i = 0; i < 4; ++i) {
    long long t = n - m;
    bool q = t < m;
    n = q ? m : t;
    m = q ? t : m;
    if(m == 0) { return n; }
  }
  return gcd_impl(n, m);
}

static inline long long gcd(long long n, long long m) {
  return n > m ? gcd_pre(n, m) : gcd_pre(m, n);
}

//区間GCD
template<class typeNode> struct nodeGCD {
	typeNode unitNode = 0;
	inline typeNode funcNode(typeNode l,typeNode r){return gcd(l,r);}
};

// solution by binary search in arbitary range on disjn sparse table 
int main() {
	SPEED
	int N; cin >> N;
	vector<ll> A(N+1,1);
	for(int i = 0; i < N; ++i) cin >> A[i];
	SparseTable<nodeGCD<ll>> st(A);
	ll ans = 0;
    for(int i = 0; i < N; ++i) {
        if(A[i] == 1){
            ans += (N-i);
			continue;
        }
		if(st.get(i,N) != 1){
			continue;
		}
		int ok = N,ng = i,md;
		while(ok-ng>1){
			md = (ok+ng)>>1;
			(st.get(i,md+1)==1?ok:ng)=md;
		}
		ans += (N-ok);
    }
    cout << ans << endl;
}