#region Header
#!/usr/bin/env python3
# from typing import *

import sys
import io
import math
import collections
import decimal
import itertools
from queue import PriorityQueue
import bisect
import heapq

def input():
    return sys.stdin.readline()[:-1]

sys.setrecursionlimit(1000000)
#endregion

# _INPUT = """5
# 1 2 3 4 5
# """
# sys.stdin = io.StringIO(_INPUT)


def get_divisors(n):
    lower_divisors = []
    upper_divisors = []
    i = 1
    while i * i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]

def main():
    N = int(input())
    X = sorted(map(int, input().split()))

    MaxX = max(X)

    dp = [0 for _ in range(MaxX + 1)]

    for i in range(N):
        divs = get_divisors(X[i])
        v = 0
        for d in divs:
            if d < X[i]:
                v = max(v, dp[d])
        dp[X[i]] = v + 1

    print(max(dp))

if __name__ == '__main__':
    main()