#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
#include <cassert>
#include <complex>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
const int inf = 1e8;


ll gcd(ll a, ll b) {
	if (b > a) {
		ll tmp = b;
		b = a;
		a = tmp;
	}
	if (a%b == 0)return b;
	else return gcd(b, a%b);
}

int dp[1000010];

int main() {
    int n;
    cin>>n;
    vector<int>x(n);
    for(int i=0;i<n;i++)cin>>x[i];
    sort(x.begin(),x.end());
    for(int i=0;i<n;i++){
        dp[x[i]]=max(dp[x[i]],1);
        int m = x[i];
        for(int j=1;j*j<=m;j++){
            if(m%j==0){
                int t1 = j;
                int t2 = m/j;
                if(x[i]>t1)dp[x[i]]=max(dp[x[i]],dp[t1]+1);
                if(x[i]>t2)dp[x[i]]=max(dp[x[i]],dp[t2]+1);
            }
        }
    }
    int ans = 0;
    for(int i=1;i<=1000000;i++){
        ans = max(ans,dp[i]);
    }
    cout<<ans<<endl;
}