#include <bits/stdc++.h>
using namespace std;
#define pb push_back
using ll = long long;
using vi = vector <int>;
using pii = pair <int, int>;
const ll mod = 998244353;
//~ const ll mod = 1e9 + 7;
ll qpow(ll a, ll b, ll m = mod) { ll r = 1, t = a;
	for(; b; b /= 2) { if(b & 1) r = r * t % m; t = t * t % m; } return r; }

const int N = 5e5 + 11;
const int LOGN = 20;
int st[LOGN][N];
 
int query(int l, int r) {
	int b = __lg(r - l + 1);
	return gcd(st[b][l], st[b][r - (1 << b) + 1]);
}
 
int main() {
	ios::sync_with_stdio(0);
	
	int n; cin >> n;
	for(int i = 1; i <= n; i ++)
		cin >> st[0][i];
	
	for(int k = 1; k < LOGN; k ++) {
		for(int i = 1; i <= n; i ++)
			if(i + (1 << k) <= n + 1) {
				st[k][i] = gcd(st[k - 1][i], st[k - 1][i + (1 << (k - 1))]);
			}
	}
	
	ll ans = 0;
	
	for(int i = 1; i <= n; i ++) {
		if(query(i, n) == 1) {
			int l = i, r = n + 1;
			while(l + 1 < r) {
				int m = (l + r) / 2;
				if(query(i, m - 1) == 1)
					r = m;
				else
					l = m;
			}
			
			ans += n - l + 1;
		}
	}
	
	cout << ans << '\n';
}