#include <iostream>
#include <stdio.h>
#include <set>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
std::vector<int> vec,con[100000],cs;
std::map<int,int> ms;
int main() {
	// your code goes here
	std::set<int> sets;
	int n;
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		int e;
		scanf("%d",&e);
		vec.push_back(e);
		sets.insert(e);
		cs.push_back(0);
	}
	std::sort(vec.begin(),vec.end());
	for(int i=0;i<n;i++){
		ms[vec[i]]=i;
	}
	
	for(int i=0;i<n;i++){
		int p=vec[i];
		for(int j=1;j*j<=p;j++){
			if(p%j==0){
				int k=p/j;
				if((sets.find(j)!=sets.end())&&(j!=p)){
					con[ms[j]].push_back(i);
				}
				if(k==j)continue;
				
				if((sets.find(k)!=sets.end())&&(k!=p)){
					con[ms[k]].push_back(i);
				}
			}
		}
	}
	int ans=0;
	for(int i=0;i<n;i++){
		for(int j=0;j<con[i].size();j++){
			int p=con[i][j];
			cs[p]=std::max(cs[p],cs[i]+1);
			ans=std::max(ans,cs[p]);
		}
	}
	printf("%d\n",ans+1);
	return 0;
}