#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
const int N=2e6+7;
const int M=1e6+7; 
int n,f[N],a[N];
bool vis[N];
signed main(){
//	freopen("sequence.in","r",stdin);
//	freopen("sequence.out","w",stdout);
    cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];sort(a+1,a+1+n);
	for(int i=1;i<=n;i++)f[a[i]]=1,vis[a[i]]=1;
	for(int i=1;i<=n;i++)for(int j=2;a[i]*j<M;j++)if(vis[j*a[i]])f[j*a[i]]=max(f[j*a[i]],f[a[i]]+1);
	int res=0;
	for(int i=1;i<=n;i++)res=max(res,f[a[i]]);
	cout<<res;
}