import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = (1 << 63)-1
inf = (1 << 31)-1
md = 10**9+7
# md = 998244353

from collections import defaultdict
from bisect import bisect

mx = 300005
n = II()
aa = LI()
atoi = [[] for _ in range(mx)]
dp = defaultdict(lambda: inf)
for i, a in enumerate(aa):
    atoi[a].append(i)
    if a not in dp: dp[a] = i

for k in range(n):
    if not dp:
        print(k)
        exit()
    ndp = defaultdict(lambda: inf)
    for a, i in dp.items():
        for b in range(a+a, mx, a):
            if atoi[b] and atoi[b][-1] > i:
                j = bisect(atoi[b], i)
                ni = atoi[b][j]
                ndp[b] = min(ndp[b], ni)
    dp = ndp

print(n)