package longestsequence;

import java.util.Scanner;

public class Main {
	public static int X_MAX = 2000000;
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] x = new int[n];
		for(int i=0;i<n;i++) {
			x[i] = Integer.parseInt(sc.next());
		}
		System.out.println(solve(n,x));
	}

	public static int solve(int n,int[] x) {
		int[] dp = new int[X_MAX+1];
		for(int i:x) {
			dp[i] = 1;
		}
		int ans = 0;
		for(int i=1;i<=X_MAX;i++) {
			if (dp[i] <= 0) {
				continue;
			}
			for(int j=i*2;j<=X_MAX;j+=i) {
				if (dp[j] >= 1) {
					dp[j] = Math.max(dp[j], dp[i] + 1);
				}
			}
			ans = Math.max(ans, dp[i]);
		}
		return ans;
	}

}