import sys
sys.setrecursionlimit(10000)
input = sys.stdin.buffer.readline

N = int(input())

def GCD(l,r):
	return l if r == 0 else GCD(r,l % r)

M = 1
while M < N:
	M *= 2
node = [0]*(2*M)

def update(idx,var):
	idx += M
	node[idx] = var
	while idx > 0:
		idx >>= 1
		node[idx] = GCD(node[2*idx + 0],node[2*idx + 1])

def get(l,r):
	vl = 0
	vr = 0
	l += M
	r += M
	while l < r:
		if l&1 :
			vl = GCD(vl,node[l])
			l += 1
		if r&1 :
			r -= 1
			vr = GCD(node[r],vr)
	return GCD(vl,vr)

A = list(map(int,input().split()))
for i in range(N):
	update(i,A[i])

ans = 0
for i in range(N):
	if A[i] == 1:
		ans += (N-i)
	else:
		ok = N
		ng = i
		while ok-ng > 1 :
			md = (ok+ng)//2;
			if get(i,md+1)==1:
				ok = md
			else:
				ng = md
		ans += (N-ok)
print(ans)