# coding: utf-8
# Your code here!

import sys
readline = sys.stdin.readline
read = sys.stdin.read

n,*a = [int(i) for i in read().split()]

MAX = 1+3*10**5
#MAX = 20
ans = [1]*n
d = {}
for i,ai in enumerate(a):
    if ai in d:
        d[ai].append(i)
    else:
        d[ai] = [i]

sa = sorted([(ai,i) for i,ai in enumerate(a)],key = lambda x: x[0])
from bisect import bisect_left
from itertools import groupby
for k,g in groupby(sa,key = lambda x: x[0]):
    c = sorted([[i,ans[i]] for a,i in g],key = lambda x: x[0])
    l = len(c)
    for i in range(1,l):
        c[i][1] = max(c[i][1],c[i-1][1])
    
    #print(k,c)
        
    for p in range(2*k,MAX,k):
        if p in d:
            for j in d[p]:
                idx = bisect_left(c,[j,-1])
                #print(k,p,idx,j,ans)
                if idx >= 1: 
                    ans[j] = max(ans[j],c[idx-1][1]+1)
    
    #print(ans)
    
print(max(ans))