Squirrel Liss is interested in sequences. She also has preferences of integers. She thinks *n* integers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> are good.

Now she is interested in good sequences. A sequence *x*<sub class="lower-index">1</sub>, *x*<sub class="lower-index">2</sub>, ..., *x*<sub class="lower-index">*k*</sub> is called good if it satisfies the following three conditions:
 -  The sequence is strictly increasing, i.e. *x*<sub class="lower-index">*i*</sub> &lt; *x*<sub class="lower-index">*i* + 1</sub> for each *i* (1 ≤ *i* ≤ *k* - 1). -  No two adjacent elements are coprime, i.e. *gcd*(*x*<sub class="lower-index">*i*</sub>, *x*<sub class="lower-index">*i* + 1</sub>) &gt; 1 for each *i* (1 ≤ *i* ≤ *k* - 1) (where *gcd*(*p*, *q*) denotes the greatest common divisor of the integers *p* and *q*). -  All elements of the sequence are good integers. 
Find the length of the longest good sequence.
The input consists of two lines. The first line contains a single integer *n* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>) — the number of good integers. The second line contains a single-space separated list of good integers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> in strictly increasing order (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">5</sup>; *a*<sub class="lower-index">*i*</sub> &lt; *a*<sub class="lower-index">*i* + 1</sub>).
n = int(input())
a = [int(_) for _ in input().split()]

map_table = {}

a = set(a)
a = list(a)
a.sort()

def get_uoc(b):
    i = 2
    res_func = []
    while b != 1:
        if b % i == 0:
            res_func.append(i)
            while b % i == 0:
                b //= i

        if i == 2:
            i += 1
        else:
            i += 2

    return res_func

res = 0

for v in a:
    uoc_v = get_uoc(v)

    max_uoc_score = 0
    for uv in uoc_v:
        if uv in map_table:
            max_uoc_score = max_uoc_score if max_uoc_score > map_table[uv] else map_table[uv]
    res = max(res, max_uoc_score + 1)
    for uv in uoc_v:
        map_table[uv] = max_uoc_score + 1

print(res)

