#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
//const ll mod = 1000000007;
ll N;
ll A[300001];
ll dp[300001];

vector<int> Div(int a) {
    vector<int> ret;
    for(int i = 1; i * i <= a; i++) {
        if(a % i != 0) continue;
        ret.push_back(i);
        if(i * i != a) ret.push_back(a / i);
    }
    return ret;
}

int main() {
    //cout.precision(10);
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> N;
    for(int i = 0; i < N; i++) cin >> A[i];
    sort(A, A + N);
    for(int i = 1; i <= 3e5; i++) dp[i] = 1;
    ll ans = 0;
    for(int i = N - 1; i >= 0; i--) {
        //for(int i = 0; i <= 10; i++) cerr << dp[i] << " ";
        //cerr << endl;
        ll New = dp[A[i]] + 1;
        chmax(ans, dp[A[i]]);
        vector<int> v = Div(A[i]);
        for(auto val : v) {
            if(val == A[i]) continue;
            chmax(dp[val], New);
        }
    }
    cout << ans << endl;
    return 0;
}