#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    int n;
    cin >> n;
    vector<ll> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];

    int lg = 1;
    while ((1 << lg) <= n) lg++;

    vector<vector<ll>> table(lg, vector<ll>(n));
    for (int i = 0; i < n; i++) table[0][i] = a[i];

    for (int j = 0; j + 1 < lg; j++) {
        for (int i = 0; i+(1<<(j+1)) <= n; i++) {
            table[j + 1][i] = gcd(table[j][i], table[j][i+(1<<j)]);
        }
    }

    auto prod = [&](int l, int r) -> ll {
        int k = 63 - __builtin_clzll((ll)r-l);
        return gcd(table[k][l], table[k][r - (1 << k)]);
    };

    ll ans = 0;
    int r = 0;
    for (int l = 0; l < n; l++) {
        if (r < l) r = l;
        while (r < n && prod(l, r + 1) != 1) {
            r++;
        }
        ans += r - l;
    }

    ll total = 1LL * n*(n+1) / 2;
    cout << total - ans << endl;
}