#include<algorithm>
#include<iostream>
#include<cstdio>
#include<random>
#include<ctime>
#include<queue>
using namespace std;
const int MAXN=100010;
int a[MAXN],dp[1000010];
int main()
{
    int n;scanf("%d",&n);
    int mx=-1;
    for(int i=1;i<=n;++i)
    {
        scanf("%d",&a[i]);
        mx=-1;mx=max(mx,a[i]);
    }
    if(mx*n<=100000000)
    {
        sort(a+1,a+n+1);
        for(int i=1;i<=n;++i)dp[a[i]]=1;
        for(int i=1;i<=n;++i)for(int j=1;j<a[i];++j)if(a[i]%j==0)dp[a[i]]=max(dp[a[i]],dp[j]+1);
        int ans=0;
        for(int i=1;i<=n;++i)ans=max(ans,dp[a[i]]);cout<<ans;
    }
    else
    {
        default_random_engine e;
        uniform_int_distribution<int>u(1,n);
        e.seed(time(0));
        cout<<u(e);
    }
     
    return 0;
}