#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;

ll N,M,H,W,Q,K,A,B;
string S;
const ll MOD = 998244353;
//const ll MOD = (1e+9) + 7;
const ll INF = 1LL<<60;
typedef pair<ll, ll> P;

ll gcd(ll a, ll b){
    if(a < b) swap(a, b);
    if(b < 0) return a;
    ll d = a;
    if(b != 0){
        d = gcd(b, a%b);
    }
    return d;
}
class SEGTREE{
            ll n, dflt;
      		vector<ll> dat;
        public:
        	SEGTREE(unsigned long _n, ll _a) : dat(_n * 4, _a){
        	    n = 1;
        	    dflt = _a;
        	    while(n < _n) n *= 2;
            }
            void update(ll k, ll a){
                k += n;
                dat[k] = a;
                while(k > 0){
                    k /= 2;
                    dat[k] = gcd(dat[k * 2], dat[k * 2 + 1]);
                }
            }
            void init(vector<ll> &v){
        	    for(int i = 0; i < v.size(); ++i) dat[i + n] = v[i];
        	    for(int i = n - 1; i >= 1; --i) {
        	        dat[i] = gcd(dat[i * 2], dat[i * 2 + 1]);
        	    }
        	}
            ll Q(ll a, ll b){
        	    return query(a, b, 1, 0, n);
        	}
            ll query(ll a, ll b, ll k, ll l, ll r){
                if(r <= a || b <= l) return dflt;
                if(a <= l && r <= b) return dat[k];
                ll vl = query(a, b, k * 2, l, (l + r) / 2);
                ll vr = query(a, b, k * 2 + 1, (l + r) / 2, r);
                return gcd(vl, vr);
            }
            //単項にアクセスする[]だが、書き換え厳禁
            //一応後でinitすれば書き換えてもよさそうだが…
            ll & operator [](int k) {return dat[k + n];}
    };
int main() {
    cin>>N;
    vec a(N);
    rep(i,N) cin>>a[i];
    SEGTREE seg(N, -1);
    seg.init(a);
    ll ans = 0, l = 0, r = 1;
    ll now = seg.Q(l, r);
    while(l != N){
        if(now == 1){
            ans += N - r + 1;
            if(++l == r) ++r;
        }else if(r != N){
            ++r;
        }else{
            ++l;
        }
        if(l == N) break;
        now = seg.Q(l, r);
        //cout<<l<<' '<<r<<' '<<ans<<endl;
    }
    cout<<ans<<endl;
    //cout<<seg.Q(1, 3)<<endl;
}