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

from fractions import gcd

A=list(map(int,input().split()))

if(len(A)==1):
    print(1)
else:
    if(A[0]==1):
        A=A[1:]
    Mem={}
    def Solve(A,i,p,count,Taken):
        if(i==len(A)):
            return count
        if((p,i) in Mem):
            return Mem[(p,i)]
        if(gcd(p,A[i])!=1 or count==0):
            x=Solve(A,i+1,A[i],count+1,Taken+[A[i]])
            y=Solve(A,i+1,p,count,Taken)
            Mem[(p,i)]=max(x,y)
            return Mem[(p,i)]
        else:
            x=Solve(A,i+1,p,count,Taken)
            Mem[(p,i)]=x
            return x
    print(Solve(A,0,1,0,[]))
