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>).

global maxi
def lis(list, SubStruc, length):
    for i in range(1,length):
        for j in range(i):
            if list[i]>list[j] and SubStruc[i]<(SubStruc[j]+1) and coprime2(list[i],list[j])==1:
                SubStruc[i]=SubStruc[j]+1
                global maxi
                maxi=max(maxi,SubStruc[i])
def coprime2(a, b):
    from math import gcd as bltin_gcd
    if(bltin_gcd(a, b)==1 or bltin_gcd(a, b)==0):
        return 0
    else:
        return 1
def main():
    size=int(input())
    global maxi
    maxi=1
    llist=list(map(int,input().split()))
    SubStruc=[1]*len(llist)
    #print(llist)
    length=len(llist)
    lis(llist, SubStruc, length)
    #print(SubStruc)
    print(maxi)

main()