input()
n=sorted(map(int,input().split()))
m=max(n)
dp=[0]*(m+1)
for i in n:dp[i]=1
for i in n:
 for j in range(i*2,m+1,i):
  if dp[j]:dp[j]=max(dp[j],dp[i]+1)
print(max(dp))