import bisect

n = int(input())
A = list(map(int,input().split()))
M = 3*10**5+5
count = [0]*M
for a in A:
    count[a] += 1

lis = [[] for i in range(M)]
for i in range(M)[::-1]:
    if count[i] == 0:
        continue
    for j in range(i*2,M,i):
        if count[j]:
            lis[j].append(i)

ans = [0]*M

for a in A:
    cand = 0
    for j in lis[a]:
        cand = max(cand,ans[j])
    ans[a] = cand+1
print(max(ans))