#include<bits/stdc++.h>

using namespace std;
typedef long long int ll;

#define debugv(v) printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;
#define debugm(m) printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;
#define debugaa(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}
#define ALL(v) (v).begin(),(v).end()
#define BIGINT 0x7FFFFFFF
#define E107 1000000007

template<typename T1,typename T2>
ostream& operator <<(ostream &o,const pair<T1,T2> p){o<<"("<<p.first<<":"<<p.second<<")";return o;}

int m,n;

int mark[1000005];
deque<int> point;
//int dp[100005];

int main(){
    int i,j,k,l;
    
    cin>>n;
    
    int big=0;
    for (i=0;i<n;i++){
        scanf("%d",&k);
        mark[k]=1;
        point.push_back(k);
        big=max(big,k);
    }
    
    int mx=1;
    i=1;
    for (int e=1;e<=big;e++){
        if (!mark[e]) continue;
        k=1;
        for (j=2;j*e<=big;j++){
            //printf("%d %d %d\n",e,e/j);
            int &p=mark[e*j];
            if (p){
                p=max(p,mark[e]+1);
                mx=max(mx,p);
            }
        }
    }
    
    cout<<(mx)<<endl;
    

    return 0;
}