#include <iostream>
#include <stdio.h>
#include <cstring>
#include <math.h>
#include <algorithm>
#include <vector>
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ll long long
#define LL long long
#define mass 1000000007
using namespace std;
int keta(int n,int k){return (n/int(pow(10,double(k-1)))) % 10;} //nの下からk桁目
void qsort(int *,int,int);


int main(){
	
	int n;
	cin>>n;
	int *x;
	x=new int[n];
	int *a;
	a=new int[n];
	rep(i,n){
		cin>>x[i];
		a[i]=1;
	}
	if(n>=2) qsort(x,0,n-1);

	int ans=0;

	rep(i,n){
		rep(j,i){
			if(x[j]%x[i]==0){
				a[i]=max(a[i],a[j]+1);
			}
		}
		ans=max(ans,a[i]);
	}
	cout<<ans<<endl;



	delete []x;
	delete []a;
	return 0;


}

void qsort(int *x,int begin,int end){
	int i,j;
	i=begin;
	j=end;
	int z;
	int pivot=x[(i+j)/2];

	while(1){
		while(x[i]>pivot){
			i++;
		}
		while(x[j]<pivot){
			j--;
		}
		if(j<=i){
			break;
		}
		z=x[i];x[i]=x[j];x[j]=z;
		i++;j--;
	}
	if(i-begin>1) qsort(x,begin,i-1);
	if(end-j>1) qsort(x,j+1,end);
}