#include <bits/stdc++.h>
using namespace std;
// #define int long long
using ll=long long;
using vi=vector<int>;
using vl=vector<long long>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
#define ITR(v,c) for(auto v=begin(c);v!=end(c);v++)
#define FORE(x,c) for(auto &x:c)
#define FOR(v,a,n) for(int v=a;v<(int)(n);v++)
#define REP(v,n) FOR(v,0,n)
#define RREP(v,n) for(int v=((int)(n)-1);v>=0;v--)
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define SZ(c) ((int)c.size())
const int DX[9]={0,1,0,-1,1,1,-1,-1,0}, DY[9]={-1,0,1,0,-1,1,1,-1,0};
const int INF=1e9; const long long INFLL=1e18;
template<class T> ostream& operator << (ostream &os, const vector<T> &v) {
    ITR(i,v) os<<*i<<(i==end(v)-1?"":" "); return os; }
template<class T> istream& operator >> (istream &is, vector<T> &v) {
    ITR(i,v) is>>*i; return is; }
//------------------------------------------------------------------------------

ll dp[1000001];
signed main() {
    int n;
    cin>>n;
    vi a(n);
    cin>>a;
    fill(ALL(dp),-INF);
    FORE(x,a) dp[x]=1;

    int M=(*max_element(ALL(a)));
    ll ans=0;
    FOR(i,1,M+1) {
        if(dp[i]<0) continue;
        vi div;
        for(int j=1; j*j<=i; j++) {
            if(i%j==0) {
                div.push_back(j);
                div.push_back(i/j);
            }
        }
        FORE(x,div) {
            if(x==i) continue;
            dp[i]=max(dp[i],dp[x]+1);
        }
        ans=max(ans,dp[i]);
    }
    cout<<ans<<endl;
    return 0;
}