#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
#define all(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
using pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;

template<class T>
bool chmax(T& p, T q) {
    if (p < q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}
template<class T>
bool chmin(T& p, T q) {
    if (p > q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}
ll gcd(ll(a), ll(b)) {
    if (a == 0)return b;
    if (b == 0)return a;
    ll c = a;
    while (a % b != 0) {
        c = a % b;
        a = b;
        b = c;
    }
    return b;
}
ll Eugrid(ll A, ll B, ll& x, ll& y) {
    if (B == 0) {
        x = 1;
        y = 0;
        return A;
    }
    ll C = gcd(A, B);
    ll D = Eugrid(B, A % B, y, x);
    y -= A / B * x;
    return D;
}//Ax+By=gcd(A,B)の解

ll op(ll a, ll b) {
    return gcd(a, b);
}
ll e() {
    return 0;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll N;
    cin >> N;
    segtree<ll, op, e> seg(N+1);
    rep(i, N) {
        ll A;
        cin >> A;
        seg.set(i, A);
    }
    seg.set(N, 1);
    ll an = 0;
    ll R = 1;
    rep(i, N) {
        R = max(R, i+1);
        while (seg.prod(i, R) > 1)R++;
        an += N-R+1;
    }
    cout << an << endl;

}