#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
using namespace std;
 
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
//#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592
 
const double EPS = 1e-10;
 
using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;

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

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

    SegmentTree(vector<Monoid> v){
        int k = v.size();
        n = 1; while(n < k) n *= 2;
        node.resize(2*n-1,0); //単位元で初期化
        for(int i = 0; i < k; i++) node[i+n-1] = v[i];
        for(int i = n-2; i >= 0; i--) node[i] = gcd(node[2*i+1],node[2*i+2]); //書き換える
    }

    SegmentTree(int k){
        n = 1; while(n < k) n *= 2;
        node.resize(2*n-1,0); //書き換える
    }

    void update(int k, Monoid x){
        k += n-1;
        node[k] = x;
        while(k > 0){
            k = (k-1)/2;
            node[k] = gcd(node[2*k+1],node[2*k+2]); //書き換える
        }
    }

    //[a,b)のクエリに答える
    Monoid query(int a, int b, int k = 0, int l = 0, int r = -1){
        if(r < 0) r = n;
        if(b <= l || a >= r) return 0;
        if(a <= l && b >= r) return node[k];
        else{
            Monoid s = query(a,b,2*k+1,l,(l+r)/2);
            Monoid t = query(a,b,2*k+2,(l+r)/2,r);
            return gcd(s,t); //書き換える
        }
    }
};

int main(){
    int n; cin >> n;
    vector<ll> a(n);
    rep(i,n) cin >> a[i];
    SegmentTree<ll> seg(a);
    ll ans = 0;
    rep(i,n){
        int ng = -1,ok = i+1;
        while(ok-ng > 1){
            int mid = (ok+ng)/2;
            if(seg.query(mid,i+1) == 1) ng = mid;
            else ok = mid;
        }
        ans += ng+1;
    }
    cout << ans << endl;
}