#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000


int main(){
	
	int N;
	cin>>N;
	
	vector<vector<int>> ind(300005,vector<int>());
	
	vector<int> A(N);
	for(int i=0;i<N;i++){
		scanf("%d",&A[i]);
		ind[A[i]].push_back(i);
	}
	
	vector<vector<int>> Y(N,vector<int>());
	
	for(int i=0;i<N;i++){
		for(int j=1;j*j<=A[i];j++){
			if(A[i]%j==0){
				Y[i].push_back(j);
				Y[i].push_back(A[i]/j);
			}
		}
	}
	
	vector<int> dp(N,1);

	
	for(int i=0;i<N;i++){
		for(int j=0;j<Y[i].size();j++){
			int n = Y[i][j];
			if(n==A[i])continue;
			auto it = lower_bound(ind[n].begin(),ind[n].end(),i);
			int x;
			if(it==ind[n].begin()){
				x=1;
			}
			else{
				it--;
				x = 1+dp[(*it)];
			}
			dp[i] = max(dp[i],x);
		}
	}
	
	int ans = 0;
	
	for(int i=0;i<N;i++){
		ans = max(ans,dp[i]);
		//cout<<dp[i]<<endl;
	}
	
	cout<<ans<<endl;
	
	return 0;
}