import math

def get_divisors(n):
	if n == 1:
		return []
	ret = []
	for i in range(1, int(math.sqrt(n)) + 1):
		if n % i == 0:
			ret.append(i)
			if i != 1 and i != n // i:
				ret.append(n // i)
	return ret

input()
xi = sorted(map(int, input().split()))

dp = [-99999 for _ in range(10**6 + 1)]
max_len = 0
for x in xi:
	di = get_divisors(x)
	if di == [1] and x != 1 and xi[0] == 1:
		dp[x] = 2
	elif di == [1] and x != 1:
		dp[x] = 1
	elif x == 1:
		dp[x] = 1
	else:
		dp[x] = max([dp[d] for d in di]) + 1
	max_len = max(max_len, dp[x])
print(max_len)