#N,K=map(int, input().split())
N=int(input())
A=list(map(int, input().split()))
D={}
def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]
for a in A:
  B=make_divisors(a)
  d=1
  for b in B:
    if b in D:
      d=max(d,D[b]+1)
  if a not in D:
    D[a]=0
  D[a]=d 
print(max(D.values()))