import sys
import math

def main():
    n = int(sys.stdin.readline())
    a = list(map(int, sys.stdin.readline().split()))
    
    ans = 0
    prev_gcd = dict()  # current_gcds starts empty
    
    for num in a:
        current_gcd = {}
        # Add the current number as a subarray of length 1
        current_gcd[num] = 1
        
        # Merge with previous GCDs
        for g, cnt in prev_gcd.items():
            new_g = math.gcd(g, num)
            if new_g in current_gcd:
                current_gcd[new_g] += cnt
            else:
                current_gcd[new_g] = cnt
        
        # Add the count of GCD 1 to the answer
        ans += current_gcd.get(1, 0)
        
        # Update prev_gcd for the next iteration
        prev_gcd = current_gcd
    
    print(ans)

if __name__ == "__main__":
    main()