#include<bits/stdc++.h>
#define rep(i,a) for(int i=(int)0;i<(int)a;++i)
#define rrep(i,a) for(int i=(int)a-1;i>=0;--i)
#define REP(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define RREP(i,a,b) for(int i=(int)a-1;i>=b;--i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
typedef std::vector<int> vi;
typedef std::vector<std::vector<int>> vvi;
typedef std::vector<long long> vl;
typedef std::vector<std::vector<long long>> vvl;
#define out(x) cout<<x<<"\n";
using ll=long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;
 
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}


ll gcd(ll n, ll m) {
    ll tmp;
    while (m!=0) {
        tmp = n % m;
        n = m;
        m = tmp;
    }
    return n;
}
 
ll lcm(ll n, ll m) {
    return abs(n) / gcd(n, m)*abs(m);//gl=xy
}

using namespace std;

template <typename Monoid>
struct Segmenttree{//0-indexed
    using F=function<Monoid(Monoid,Monoid)>;

    int sz;
    vector<Monoid>seg;
    const F f;//2つの区間の要素をマージする二項演算
    const Monoid unit;//単位元
    Segmenttree(int n,const F f,const Monoid &unit):f(f),unit(unit){
        sz=1;
        while(sz<n)sz<<=1;//簡単のため要素数を2のべき乗に
        seg.assign(2*sz,unit);
    }
    void set(int k,const Monoid &x){//k番目の要素にxを代入
        seg[k+sz]=x;
    }
    void build(){//セグメント木の構築 O(N)
        for(int k=sz-1;k>0;k--)seg[k]=f(seg[2*k+0],seg[2*k+1]);
    }
    void update(int k,const Monoid &x){//k番目の要素をxに変更する
        k+=sz;
        seg[k]=x;
        while(k>>=1){
            seg[k]=f(seg[2*k+0],seg[2*k+1]);
        }
    }
    Monoid query(int a, int b) {//区間[a,b)に対して二項演算した結果を返す
        Monoid L = unit, R = unit;
        for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
        if(a & 1) L = f(L, seg[a++]);
        if(b & 1) R = f(seg[--b], R);
            }
        return f(L, R);
    }
 
    Monoid operator[](const int &k) const {//k番目の要素を返す
        return seg[k + sz];
    }
};

void solve()
{
	ll n;
	cin >> n;
	vector<ll> a(n);
	rep(i, n) cin >> a[i];
	auto f = [](ll a, ll b) {
		return gcd(a, b);
	};
	Segmenttree<ll> sg(n,f,0LL);
	rep(i,n)sg.update(i, a[i]);
	ll x = 0;
	ll ans = 0;
	ll pos = 0;
	for (ll i = 0; i < n; ++i)
	{
		x = sg.query(i, pos);
		for (ll j = pos; j < n; ++j)
		{
			x = gcd(x, a[j]);
			if (x == 1)
			{
				ans += n - pos;
				break;
			}
			++pos;
			}
			pos = max(pos, i+1);
	}
		cout << ans << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout<<fixed<<setprecision(15);
    solve();
    return 0;
}