def divisor(n):
    sq = n ** 0.5
    border = int(sq)
    table = []
    bigs = []
    for small in range(1, border + 1):
        if n % small == 0:
            table.append(small)
            big = n // small
            bigs.append(big)
    if border == sq:  # nが平方数
        bigs.pop()
    table += reversed(bigs)
    return table


n = int(input())
a = list(map(int, input().split()))
dp = [0] * (10 ** 5 + 1)
dp[1] = 1
for i in range(n):
    tmp = divisor(a[i])
    cnt = -1
    v = -1
    for j in tmp:
        if dp[j] > v:
            cnt = j
            v = dp[j]
    dp[a[i]] = max(dp[a[i]], dp[cnt] + 1)
print(max(dp)-1)