#include<bits/stdc++.h>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
using ll = long long;
int n;
vector<int> a;

vector<long long> factors(long long n){
	vector<long long> res;
	for(long long i = 1;i*i <= n;i++){
		if(n%i==0){
			res.push_back(i);
			if(n!=n/i){
				res.push_back(n/i);
			}
		}
	}
	res.push_back(n);
	return res;
}
ll dp[101010];

void solve(){
	for(int i = 0;i<n;i++){
		auto v = factors(a[i]);
		ll mx = 0;
		for(auto &j:v){
			mx = max(mx,dp[j]);
		}
		dp[a[i]] = mx+1;
	}
	ll ans = 0;
	for(int i = 0;i<101010;i++){
		ans=  max(ans,dp[i]);
	}
	cout<<ans<<endl;
}

signed main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cin >> n;
	a = vector<int>(n);
	for(int i = 0;i<n;i++){
		cin >> a[i];
	}
	solve();
}