#include "bits/stdc++.h"
#define REP(i,n,N) for(int i=(n); i<(N); i++)
#define RREP(i,n,N) for(int i=(N-1); i>=n; i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define ALL(v) (v).begin(),(v).end()
#define p(s) cout<<(s)<<endl
#define p2(a,b) cout<<(a)<<" "<<(b)<<endl
#define v2(T) vector<vector<T>>
typedef long long ll;
using namespace std;
const ll inf=1e18+7;

int n;
int x[100010];
int dp[1000010];
int main() {
    cin>>n;
    REP(i,0,n) cin>>x[i];
    sort(x,x+n);
    int ans=0;
    REP(i,0,n){
        dp[x[i]]=1;
    }
    REP(i,2,1000001){
        if(dp[i]){
            vector<int> vi;
            vi.push_back(1);
            for(int j=2;j*j<=i;j++){
                if(i%j==0){
                    vi.push_back(j);
                    if(j*j!=i) vi.push_back(i/j);
                }
            }
            sort(ALL(vi));
            for(auto v:vi){
                dp[i] = max(dp[i], dp[v]+1);
            }
        }
    }
    REP(i,0,n){
        ans=max(ans, dp[x[i]]);
    }
    p(ans);
    return 0;
}