n = int(input())
x = list(map(int, input().split()))
def m_div(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

from collections import defaultdict
d = defaultdict(int)
for num in x:
    d[num]=1

x.sort(reverse=True)
for num in x:
    now_len=d[num] # must be 1 or greater
    for div in m_div(num):
        if div==num or (not div in d):
            continue
        d[div] = max(d[div],now_len + 1)

print(max(d.values()))