#include <bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pb push_back
using vi = vector <int>;
using ll = long long;
using pii = pair <int, int>;
//~ const ll mod = 998244353;
const ll mod = 1e9 + 7;
ll qpow(ll a, ll b, ll m = mod) { ll r = 1, t = a;
	for(; b; b /= 2) { if(b & 1) r = r * t % m; t = t * t % m; } return r; }

const int N = 1e6 + 11;

bool a[N];
int f[N];

int main() {
	ios :: sync_with_stdio(false);
	
	int n; cin >> n;
	for(int i = 0; i < n; i ++) {
		int x; cin >> x;
		a[x] = 1;
	}
	
	int ans = 0;
	for(int i = 1; i < N; i ++) if(a[i]) {
		f[i] = max(f[i], 1);
		ans = max(ans, f[i]);
		for(int j = i * 2; j < N; j += i)
			if(a[j]) f[j] = max(f[j], f[i] + 1);
	}
	cout << ans << '\n';
}