#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>

#define REP(i,n) for(long (i)=0;(i)<(n);(i)++)
#define FOR(i,a,b) for(long (i)=(a);(i)<(b);(i)++)
#define RREP(i,a) for(long (i)=(a)-1;(i)>=0;(i)--)
#define FORR(i,a,b) for(long (i)=(a)-1;(i)>=(b);(i)--)
#define PI acos(-1.0)
#define DEBUG(C) cout<<C<<endl;
#define VI vector<int>
#define VL vector<long>
#define VD vector<double>
#define PII pair<int,int>
#define PDD pair<double,double>
#define PLL pair<long,long>
#define ALL(a) (a).begin(),(a).end()
#define SORT(a) sort(ALL(a))
#define REVERSE(a) reverse(ALL(a))
#define MP make_pair
#define FORE(a,b) for(auto &&a:b)

using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const int INF=1e9;
const int MOD=INF+7;

template<typename T>
vector<T> divisor(T a){ //aは含まない
    vector<T> ret;
    if(a>1) for(T i=1;i*i<=a;i++){
        if(a%i==0){
            ret.emplace_back(i);
            if(i!=a/i && i!=1) ret.emplace_back(a/i);
        }
    }
    return ret;
}

int main(void){
    int N; cin>>N;
    vector<int> x(N);
    REP(i,N) cin>>x[i];
    SORT(x);
    VL dp(x.back()+1,0);
    long ma;
    FORE(el,x){
        dp[el]=1;
        vector<long> div=divisor<long>(el);
        FORE(d,div){
            dp[el]=max(dp[el],dp[d]+1);
            //if(dp[el]==2) cout<<el<<" "<<d<<endl;
        }
    }
    SORT(dp); cout<<dp.back()<<endl;
    return 0;
}