#!/usr/bin/env pypy3

import array
import math


MAX_X = 10 ** 6


def divisors_without_self(n, typecode="L"):
    ds = array.array(typecode)
    if n != 1:
        for i in range(1, math.floor(math.sqrt(n)) + 1):
            r, m = divmod(n, i)
            if m == 0:
                ds.append(i)
                if i != 1 and i != r:
                    ds.append(r)
    return ds


def main():
    _ = input()
    xs = sorted(map(int, input().split()))
    dp = array.array("L", (0 for _ in range(MAX_X + 1)))
    for x in xs:
        dp[x] = 1
        for y in divisors_without_self(x):
            dp[x] = max(dp[x], dp[y] + 1)
    print(max(dp))


if __name__ == '__main__':
    main()