265_D. Good Sequences_6385
Squirrel Liss is interested in sequences. She also has preferences of integers. She thinks n integers a1, a2, ..., an are good.

Now she is interested in good sequences. A sequence x1, x2, ..., xk is called good if it satisfies the following three conditions:

  * The sequence is strictly increasing, i.e. xi < xi + 1 for each i (1 ≤ i ≤ k - 1). 
  * No two adjacent elements are coprime, i.e. gcd(xi, xi + 1) > 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.

Input

The input consists of two lines. The first line contains a single integer n (1 ≤ n ≤ 105) — the number of good integers. The second line contains a single-space separated list of good integers a1, a2, ..., an in strictly increasing order (1 ≤ ai ≤ 105; ai < ai + 1).

Output

Print a single integer — the length of the longest good sequence.

Examples

Input

5
2 3 4 6 9


Output

4


Input

9
1 2 3 5 6 7 8 9 10


Output

4

Note

In the first example, the following sequences are examples of good sequences: [2; 4; 6; 9], [2; 4; 6], [3; 9], [6]. The length of the longest good sequence is 4.
def main():
    maxn = 100005
    n = int(raw_input())
    f = [0] * maxn
    g = [0] * maxn
    a = map(int, raw_input().split())
    for i in range(2, maxn, 1):
        if g[i] == 0:
            for k in range(i, maxn, i):
                g[k] = i
    ans = 1
    for i in range(n):
        now = a[i]
        opt = 0
        while g[now] > 0:
            x = g[now]
            while now % x == 0:
                now /= x
            if f[x] > opt:
                opt = f[x]
        opt += 1
        if ans < opt:
            ans = opt
        now = a[i]
        while g[now] > 0:
            x = g[now]
            while now % x == 0:
                now /= x
            if f[x] < opt:
                f[x] = opt    
    print ans

main()
        
