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

const int N = 1000010;

int n, a[N], dp[N];

signed main() {
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); 
	cin >> n;
	for (int i = 1; i <= n; i ++ ) cin >> a[i];
	sort(a + 1, a + n + 1);
	for (int i = 1; i <= n; i ++ ) {
		dp[a[i]] = max(dp[a[i]], 1ll);
		for (int j = a[i] + a[i]; j < N; j += a[i])
			dp[j] = max(dp[j], dp[a[i]] + 1);
	}
	int res = 0;
	for (int i = 1; i <= n; i ++ ) res = max(res, dp[a[i]]);
	cout << res;
	return 0;
}