#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 vl = vector <ll>;
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 = 2e5 + 11;
int f[N];

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