n = int(input())
X = set(map(int, input().split()))
ma = max(X)
dp = [0] * (ma + 1)
ans = 1
for x in sorted(X):
    if dp[x] == 0:
        dp[x] = 1
    ans = max(ans, dp[x])
    for j in range(2 * x, ma + 1, x):
        dp[j] = max(dp[j], dp[x] + 1)
print(ans)