import static java.util.Comparator.*;

import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;

public class Main {
    public static void main(String[] args) {
        PrintWriter out = new PrintWriter(System.out);
        Solver solver = new Solver(System.in, out);
        solver.solve();
        out.close();
    }
}
class Solver {
	Scanner sc;
	PrintWriter out;
    public Solver(InputStream in, PrintWriter out) {
    	sc = new Scanner(in);
    	this.out = out;
    }
    // ==========================================================
    final int max = (int)3e5+1;
    int[] maxLen = new int[max];
    List<Integer> fnc(int n) {
    	List<Integer> ans = new ArrayList<>();
    	for (int i = 1; i*i <= n; i++) {
			if(n % i != 0)	continue;
			ans.add(i);
			if(i*i != n)	ans.add(n / i);
		}
    	ans.sort(naturalOrder());
//    	for(int i : ans)	out.print(i + " ");
//    	out.println("");
    	return ans;
    }
    public void solve() {
    	int N = ni();
    	int[] A = ndi(N);
    	int ans = 0;
    	for (int i = 0; i < N; i++) {
    		if(A[i] == 1) {
    			maxLen[1] = 1;
    		} else {
	    		for(int x : fnc(A[i])){
	    			if(x == A[i])	continue;
	    			maxLen[A[i]] = Math.max(maxLen[A[i]], maxLen[x] + 1);
//	    			out.println("maxLen[" + x + "] = " + maxLen[x] + " + 1");
//	    			out.println("  -->  maxLen[" + A[i] + "] = " + maxLen[A[i]] + "");
	    		}
    		}
			ans = Math.max(ans, maxLen[A[i]]);
		}
    	out.println(ans);
    }
    // ------------------------------------------
    // 入力
    // ------------------------------------------
    public int ni() {
    	return sc.nextInt();
    }
    public long nl() {
    	return sc.nextLong();
    }
    public String ns() {
    	return sc.next();
    }
    public char[] nc() {
    	return sc.next().toCharArray();
    }
    public int[] ndi(int N) {
    	int[] ans = new int[N];
    	for (int i = 0; i < N; i++) {
			ans[i] = ni();
		}
    	return ans;
    }
    public long[] ndl(int N) {
    	long[] ans = new long[N];
    	for (int i = 0; i < N; i++) {
			ans[i] = nl();
		}
    	return ans;
    }
    public String[] nds(int N) {
    	String[] ans = new String[N];
    	for (int i = 0; i < N; i++) {
			ans[i] = ns();
		}
    	return ans;
    }
    public char[][] ndc(int N) {
    	char[][] ans = new char[N][];
    	for (int i = 0; i < N; i++) {
			ans[i] = nc();
		}
    	return ans;
    }
    public int[][] nddi(int N, int S) {
    	int[][] ans = new int[N][S];
    	for (int i = 0; i < N; i++) {
			for (int j = 0; j < S; j++) {
				ans[i][j] = ni();
			}
		}
    	return ans;
    }
}