INF = 10 ** 9
MOD = 10 **9 + 7
import sys
input = sys.stdin.readline
from math import gcd

class SparseTable():
    def __init__(self,arr,func,unit):
        self.N = len(arr)
        self.K = self.N.bit_length()
        self.func = func
        self.unit = unit
        self.table = [self.unit] * (self.N * self.K)

        for i in range(self.N):
            self.table[i] = arr[i]
        for k in range(1,self.K):
            for i in range(self.N - (1<<(k - 1))):
                self.table[i + k*self.N] = self.func(self.table[i + (k - 1)*self.N],self.table[i + (1<<(k - 1)) + (k - 1)*self.N])
        
    def query(self,l,r):
        if l >= r:
            return self.unit
        k = (r - l).bit_length() - 1
        return self.func(self.table[l + k*self.N],self.table[r - (1<<k) + k*self.N])


n = int(input())
a = list(map(int,input().split()))
sp = SparseTable(a,gcd,0)

r = 0
ans = 0
for l in range(n):
    while r < n and sp.query(l,r + 1) != 1:
        r += 1
    ans += n - r
print(ans)