import sys
import math

def main():
    input = sys.stdin.read().split()
    n = int(input[0])
    A = list(map(int, input[1:n+1]))
    
    result = 0
    prev_gcds = {}
    
    for a in A:
        curr_gcds = {}
        # Process previous GCDs
        for g, cnt in prev_gcds.items():
            new_g = math.gcd(g, a)
            if new_g in curr_gcds:
                curr_gcds[new_g] += cnt
            else:
                curr_gcds[new_g] = cnt
        # Add the current element as a subarray of length 1
        if a in curr_gcds:
            curr_gcds[a] += 1
        else:
            curr_gcds[a] = 1
        # Update the result with the count of GCD 1
        result += curr_gcds.get(1, 0)
        # Update prev_gcds for the next iteration
        prev_gcds = curr_gcds
    
    print(result)

if __name__ == "__main__":
    main()