from math import gcd 
n=int(input())
a=list(map(int,input().split()))
sz=1
while sz<n:
    sz*=2
seg=[0]*(2*sz)
for i in range(n):
    seg[i+sz]=a[i]
for i in range(sz-1,0,-1):
    seg[i]=gcd(seg[2*i],seg[2*i+1])

def query(a,b):
    if a>=b:
        return 0
    a1=a+sz
    b1=b+sz
    ret=0
    while a1<b1:
        if b1&1:
            b1-=1
            ret=gcd(ret,seg[b1])
        if a1&1:
            ret=gcd(ret,seg[a1])
            a1+=1
        a1>>=1
        b1>>=1
    return ret 
ans=0
r=1
for i in range(n):
    while r<=n:
        if query(i,r)==1:
            break
        r+=1
    ans+=(n+1-r)
print(ans)