n=int(input())
a=list(map(int,input().split()))
a.sort()
s=set(a)
m=max(a)+1
g=[[] for _ in range(m+1)]
for x in a:
  xx=x+x
  while xx<=m:
    if xx in s:
      g[xx].append(x)
    xx+=x
mat=[0]*m
seen=[1]*(m+1)
for v in a[::-1]:
  for nv in g[v]:
    if seen[nv]<seen[v]+1:
      seen[nv]=seen[v]+1
print(max(seen))