#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	int N;
	while(~scanf("%d", &N)) {
		vector<int> xs(N);
		for(int i = 0; i < N; ++ i)
			scanf("%d", &xs[i]);
		int X = *max_element(xs.begin(), xs.end());
		vector<bool> ok(X + 1);
		for(int x : xs)
			ok[x] = true;
		vector<int> dp(X + 1, -1);
		for(int x : xs)
			dp[x] = 1;
		rer(i, 1, X) {
			int x = dp[i];
			if(x == -1) continue;
			for(int j = i * 2; j <= X; j += i) if(ok[j])
				amax(dp[j], x + 1);
		}
		int ans = *max_element(dp.begin(), dp.end());
		printf("%d\n", ans);
	}
	return 0;
}