#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using u64 = uint_fast64_t;
using pii =  pair<int, int>;
using pll =  pair<long long, long long>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
constexpr char ln = '\n';
constexpr long long MOD = 1000000007;
//constexpr long long MOD = 998244353;
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return true;} return false; }
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return true;} return false; }
inline int popcount(int x) {return __builtin_popcount(x);}
inline int popcount(long long x) {return __builtin_popcountll(x);}
void print() { cout << "\n"; }
template<class T, class... Args>
void print(const T &x, const Args &... args) {
    cout << x << " ";
    print(args...);
}
///////////////////////////////////////////////////////////////////////////////////////////////////////////////


template<typename T, typename Monoid>
struct SlidingWindowAggregation {
    Monoid merge;
    T unity;
    vector<pair<T, T>> front, back;

    SlidingWindowAggregation(Monoid f, T id) : merge(f), unity(id) {}

    bool empty() const {return front.empty() and back.empty();}

    int size() const {return front.size() + back.size();}

    T fold_all() const {
        T vf = front.empty() ? unity : front.back().second;
        T vb = back.empty() ? unity : back.back().second;
        return merge(vf,vb);
    }

    void emplace(const T &val) {
        if (back.empty()) {
            back.emplace_back(val,val);
        } else {
            back.emplace_back(val,merge(back.back().second,val));
        }
    }

    void pop() {
        assert(!empty());
        if (front.empty()) {
            front.emplace_back(back.back().first,back.back().first);
            back.pop_back();
            while (!back.empty()) {
                front.emplace_back(back.back().first,merge(back.back().first,front.back().second));
                back.pop_back();
            }
        }
        front.pop_back();
    }
};

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    ll N; cin >> N;
    vector<ll> A(N);
    rep(i,N) cin >> A[i];

    auto f=[](ll a, ll b) {return gcd(a,b);};
    const ll id = 0;
    SlidingWindowAggregation SWAG(f,id);
    ll ans = N*(N+1)/2;
    for (int l = 0, r = 0; l < N; l++) {
        if (r < l) r = l;
        while (r < N and f(SWAG.fold_all(),A[r]) != 1) {
            SWAG.emplace(A[r++]);
        }
        ans -= r-l;
        if (!SWAG.empty()) SWAG.pop();
    }

    cout << ans << ln;
}