#貰うDP
from collections import defaultdict

def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)
 
    return divisors
    
N = int(input())
x = list(map(int, input().split()))
x.sort()
flag = defaultdict(int)

for xi in x:
    flag[xi] = 1
    
A = max(x)
dp = [1] * (A+1)

for xi in x:
    divisors = make_divisors(xi)
    
    for div in divisors:
        if xi != div and flag[div]:
            dp[xi] = max(dp[xi], dp[div]+1)

ans = max(dp)
print(ans)