#include <bits/stdc++.h>
using namespace std;

int n;
int x[101010];
int dp[1010101];

vector<long long> divisors(long long n) {
	vector<long long> result;
	for (long long i = 1; i * i <= n; i++) if (n % i == 0) {
		result.push_back(i);
		if (i != n / i) result.push_back(n / i);
	}
	sort(result.begin(), result.end());
	return result;
}

int main() {
	cin >> n;
	for (int i = 0; i < n; i++) scanf("%d", &x[i]);
	sort(x, x + n);

	for (int i = 0; i < n; i++) {
		dp[x[i]] = max(dp[x[i]], 1);
		for (int d : divisors(x[i])) {
			if (d < x[i]) {
				dp[x[i]] = max(dp[x[i]], dp[d] + 1);
			}
		}
	}

	int ans = *max_element(dp, dp + 1010101);
	cout << ans << endl;
}