from collections import defaultdict
from bisect import bisect_right

n = int(input())
a = [int(i) for i in input().split()]
max_a = max(a)

cnt = [1] * n
d = defaultdict(list)
for i in range(n): d[a[i]].append(i)

for i in range(n):
    x = 2 * a[i]
    while x <= max_a:
        if x in d:
            s = bisect_right(d[x], i)
            for j in d[x][s:]:
                cnt[j] = max(cnt[j], cnt[i] + 1)
        x += a[i]

print(max(cnt))