#include<iostream>
#include<algorithm>
#include<vector>

using namespace std;

#define NMAX 100000

int x[NMAX];
vector<int> ai[NMAX];

int search(int i){
	int maxn=0;
	if(ai[i].size()==0){
		return 1;
	}
	for(int j=0;j<ai[i].size();j++){
		maxn=max(maxn,search(ai[i][j]));
	}
	return maxn+1;
}

int main(){

	int N;
	int maxn=-1;

	cin>>N;
	for(int i=0;i<N;i++) cin>>x[i];

	sort(x,x+N);

	for(int i=0;i<N;i++){
		for(int j=i+1;j<N;j++){
			if(x[j]%x[i]==0){
				ai[i].push_back(j);
			}
		}

	}

	for(int i=0;i<N;i++){
		maxn=max(maxn,search(i));
	}

	cout<<maxn<<endl;
}