# 公式解説
# dp[i][j]:= Aiまで見て最後に選んだ数がjのときの最長部分列の長さ

N = int(input())
A = list(map(int, input().split()))
maxA = max(A)
dp = [[0]*(maxA+1) for i in range(N+1)]

for i in range(1, N+1):
    num = A[i-1]
    for j in range(maxA+1):
        if j != num:
            dp[i][j] = dp[i-1][j]
        elif j == num:
            mx = 0
            for k in range(1, j+1):
                if k*k > j:
                    break
                if j%k == 0:
                    mx = max(mx, dp[i-1][k])
                    mx = max(mx, dp[i-1][j//k])
            dp[i][j] = mx+1
    #print(dp[i])
                
#print(dp)

ans = max(dp[N])
print(ans)