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>).
from math import *
from sys import *
from collections import *
n=int(stdin.readline())
a=list(map(int,stdin.readline().split()))
d={}
ans=[1]*n
sieve=defaultdict(list)
size=a[-1]+1
for i in range(2,size):
    for j in range(2*i,size,i):
        sieve[j].append(i)
start=0
if a[0]==1:
    start=1
for i in range(start,n):
    tmp=0
    ele=-1
    if sieve[a[i]]==[]:
        d[a[i]]=1
    else:
        for j in sieve[a[i]]:
            if j in d:
                if gcd(j, a[i]) > 1:
                    if 1 + d[j] > tmp:
                        tmp = 1 + d[j]
                        ele = j
        if ele==-1:
            d[a[i]]=1
        else:
            d[a[i]]=tmp
            for j in sieve[a[i]]:
                d[j]=tmp
            ans[i]=tmp
stdout.write(str(max(ans))+"\n")