import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


N = int(input())
A = list(map(int, input().split()))

divs = []
for a in A:
    for i in range(1, a + 1):
        if i * i > a:
            break
        if a % i == 0:
            divs.append(i)
            divs.append(a // i)
divs = [0] + sorted(set(divs))
idx = {}
for i, d in enumerate(divs):
    idx[d] = i

dp = [[0 for _ in range(len(divs))] for _ in range(N + 1)]
dp[0][0] = 1
for i in range(N):
    n = A[i]
    for j in range(len(divs)):
        if j == 0:
            dp[i + 1][idx[n]] += dp[i][j]
        else:
            g = math.gcd(divs[j], n)
            dp[i + 1][idx[g]] += dp[i][j]
        dp[i + 1][j] += dp[i][j]
print(dp[N][1])