#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long long
#define inf 1e18
#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)
#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define mod 1000000007

using namespace std;
typedef pair<llint, llint> P;

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

struct SparseTable{
	int size;
	vector<vector<llint> > vec;
	SparseTable(){}
	SparseTable(int size){
		this->size = size;
		vec.resize(size+1);
		for(int i = 0; i <= size; i++) vec[i].resize(1<<size);
		for(int i = 0; i < (1<<size); i++) vec[0][i] = 0;  //
	}
	void set(int i, llint val){
		vec[0][i] = val;
	}
	void calc(){
		for(int i = 1; i <= size; i++){
			for(int j = 0; j < (1<<size); j++){
				if(j+(1<<(i-1)) < (1<<size)){
					vec[i][j] = gcd(vec[i-1][j], vec[i-1][j+(1<<(i-1))]); //
				}
			}
		}
	}
	llint query(int l, int r)
	{
		int k = 0;
		for(int i = 0; r-l+1 >= (1<<i); i++) k = i;
		return gcd(vec[k][l], vec[k][r-(1<<k)+1]); //
	}
};


llint n;
llint a[500005];
SparseTable sp(19);

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n;
	for(int i = 1; i <= n; i++) cin >> a[i];
	for(int i = 1; i <= n; i++) sp.set(i, a[i]);
	sp.calc();
	
	llint ans = 0;
	for(int i = 1; i <= n; i++){
		llint ub = n+1, lb = i-1, mid;
		while(ub-lb>1){
			mid = (ub+lb)/2;
			if(mid >= i && sp.query(i, mid) == 1) ub = mid;
			else lb = mid;
		}
		ans += n-ub+1;
	}
	cout << ans << endl;
	
	return 0;
}