import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner cin = new Scanner(System.in);
        int n = cin.nextInt();
        int[] nums = new int[n];
        for (int i = 0; i < n; i++) {
            nums[i] = cin.nextInt();
        }
        int[] dp = new int[n];
        int max = 1;
        Arrays.fill(dp, 1);
        //质因子 dp
        HashMap<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < n; i++) {
            int t = nums[i];
            //list收集质因子
            ArrayList<Integer> list = new ArrayList<>();
            for (int j = 2; j * j <= t; j++) {
                if (t % j == 0) {
                    list.add(j);
                    while (t % j == 0) {
                        t /= j;
                    }
                }
            }
            if (t > 1) list.add(t);
            //dp[i] 通过质因子来更新
            for (int j = 0; j < list.size(); j++) {
                if (map.containsKey(list.get(j))) {
                    dp[i] = Math.max(dp[i], map.get(list.get(j)) + 1);
                }
            }
            //map 维护质因子的最长序列
            for (int j = 0; j < list.size(); j++) {
                map.put(list.get(j), Math.max(dp[i], map.getOrDefault(list.get(j),1)));
            }
            //更新答案
            max = Math.max(max, dp[i]);
        }
        System.out.println(max);
    }
}