#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int co[1000010] = {};
int x[100010];
int main() {
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> x[i];
	}
	sort(x, x + n);
	for (int i = 0; i < n; i++) {
		int m = 1;
		for (int j = 1; j * j <= x[i]; j++) {
			if (x[i] % j == 0) {
				if (x[i] != 1 && m < co[j] + 1) {
					m = co[j] + 1;
				}
				if (j != 1 && m < co[x[i] / j] + 1) {
					m = co[x[i] / j] + 1;
				}
			}
		}
		co[x[i]] = max(co[x[i]], m);
	}
	int ans = 0;
	for (int i = 1; i < 1000010; i++) {
		if (ans < co[i]) {
			ans = co[i];
		}
	}
	cout << ans << endl;
}