def gcd(x,y):
    while x%y:
        x,y=y,x%y
    return y
def bb(l,r):
    res=seg[l]
    while l<r:
        if l&1:
            res=gcd(seg[l],res);l+=1
        if r&1:
            r-=1;res=gcd(res,seg[r])
        l//=2;r//=2
    return res



n=int(input())
v=1<<n.bit_length()
a=list(map(int,input().split()));seg=[1]*v*2
for i in range(n):
    seg[i+v]=a[i]
for i in range(v-1,0,-1):
    seg[i]=gcd(seg[i*2],seg[i*2+1])
q=0;w=1;ans=0
for i in range(n):
	q=max(q,i+1)
	w=bb(i+v,q+v)
	while q<n and w>1:
		w=gcd(a[q],w);q+=1
	if w==1:
		ans+=n-q+1
print(ans)