#!/usr/bin/env pypy3

import array
import collections
import math


def divisors_without_self(n):
    ds = set()
    if n != 1:
        for i in range(1, math.floor(math.sqrt(n)) + 1):
            r, m = divmod(n, i)
            if m == 0:
                ds.add(i)
                if i != 1 and i != r:
                    ds.add(r)
    return ds


def calc_len_of_longest_good_seq(xs):
    dp = collections.defaultdict(int)
    for x in sorted(xs):
        dp[x] = 1
        for y in divisors_without_self(x):
            dp[x] = max(dp[x], dp[y] + 1)
    return max(dp.values())


def main():
    _ = input()
    xs = array.array("L", map(int, input().split()))
    print(calc_len_of_longest_good_seq(xs))


if __name__ == '__main__':
    main()