#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

vector<int> divisors(int n){
    vector<int> res;
    for(int i=1; (long long)i*i<=n; ++i){
        if(n%i==0){
            res.push_back(i);
            int j = n/i;
            if(j!=i)res.push_back(j);
        }
    }
    return res;
}

int N;
vi divs[100000];

int main(){
    while(cin >> N){
        vi X(N), dp(N, -1);
        rep(i, N){
            scanf("%d", &X[i]);
        }
        sort(all(X));
        rep(i, N){
            divs[i] = divisors(X[i]);
            sort(all(divs[i]));
            dp[i] = 1;
        }

        int ans = 1;
        for(int i = 0; i < N; ++i){
            for(int j = 0; j < sz(divs[i]) - 1; ++j){
                auto it = lower_bound(all(X), divs[i][j]);
                if(*it == divs[i][j]){
                    int pre = (int)(it - X.begin());
                    if(pre < i && dp.at(pre) != -1){
                        dp[i] = max(dp[i], dp[pre] + 1);
                        smax(ans, dp[i]);
                    }
                }
            }
        }
        cout << ans << endl;
    }
}