#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>

using namespace std;

const int X_MAX = 1e6;

int main() {
	int n, x;
	// vector<int> nums(X_MAX + 1, 0);
	int nums[X_MAX + 1] = {0};

	// cin >> n;
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		// cin >> x;
		scanf("%d", &x);
		nums[x] = 1;
	}

	int ans = 0;
	for (int i = X_MAX; i >= 1; i--) {
		if (nums[i] == 0) {
			continue;
		}

		for (int j = i * 2; j <= X_MAX; j += i) {
			nums[i] = max(nums[i], nums[j] + 1);
		}
		ans = max(ans, nums[i]);
	}
	// cout << ans << endl;
	printf("%d\n", ans);
	return 0;
}