#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
template <class T> vector<T> make_vec(size_t a, T val) {
    return vector<T>(a, val);
}
template <class... Ts> auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec(ts...))>(a, make_vec(ts...));
}
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Graph = vector<vector<int>>;
template <typename T> struct edge {
    int to;
    T cost;
    edge(int t, T c) : to(t), cost(c) {}
};
template <typename T> using WGraph = vector<vector<edge<T>>>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;

// 素数篩＋素因数分解
// 初期化O(N),素因数分解O(logN)
// たくさん素因数分解するときはこっち
#include <cassert>
struct Sieve {
    int N;
    vector<ll> dat;
    Sieve(int n) : N(n + 1) {
        dat.resize(N);
        iota(All(dat), 0);
        init();
    }

    void init() {
        for(int i = 2; i * i <= N; i++) {
            if(dat[i] < i)
                continue;
            for(int j = i * i; j < N; j += i) {
                if(dat[j] == j)
                    dat[j] = i;
            }
        }
    }

    map<ll, int> factorize(ll n) {
        assert(n <= N);
        map<ll, int> ret;
        while(n > 1) {
            ret[dat[n]]++;
            n = n / dat[n];
        }
        return ret;
    }

    vector<int> divisor(ll n) {
        assert(n <= N);
        vector<int> ret;
        ret.pb(1);
        while(n > 1) {
            int k = dat[n];
            int num = 0;
            while(n % k == 0) {
                n /= k;
                num++;
            }
            int sz = ret.size();
            int tmp = 1;
            for(int i = 0; i < num; i++) {
                tmp *= k;
                for(int j = 0; j < sz; j++) {
                    ret.push_back(ret[j] * tmp);
                }
            }
        }
        sort(All(ret));
        return ret;
    }
};

int main() {
    int N;
    cin >> N;
    vector<int> A(N);
    rep(i, N) { cin >> A[i]; }
    Sieve sieve(301000);
    vector<int> dp(301000, 1);
    int res = 0;
    for(int i = N - 1; i >= 0; i--) {
        auto div = sieve.divisor(A[i]);
        for(auto d : div) {
            if(d == A[i])
                continue;
            dp[d] = max(dp[A[i]] + 1, dp[d]);
        }
        res = max(res, dp[A[i]]);
    }
    cout << res << endl;
}