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]*n
res = [[] for i in range(M)]
sA = [[a,i] for i,a in enumerate(A)]
sA.sort()

for a,ind in sA:
    cand = 1
    for nex in lis[a]:
        if res[nex]:
            nind = bisect.bisect_left(res[nex],ind)
            if nind:
                cand = max(cand,ans[res[nex][nind-1]]+1)
    ans[ind] = cand
    res[a].append(ind)

print(max(ans))