#include <bits/stdc++.h> 
#include <atcoder/all>
#define pub push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (ll i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (ll i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
using namespace std;
using namespace atcoder;
using ll = long long;
using Pll = pair<ll, ll>;
using mint = modint998244353;
using mint2 = modint1000000007;

constexpr long long INF = (1LL << 60);
constexpr double EPS = 1e-9;
constexpr double PI = 3.141592653589;

template <typename T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;  // aをbで更新
        return true;
    }
    return false;
}

template <typename T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;  // aをbで更新
        return true;
    }
    return false;
}

template <typename T>
T sq(T x) {
    return x * x;
}

std::string zfill(int n, const int width)
{
    std::stringstream ss;
    ss << std::setw(width) << std::setfill('0') << n;
    return ss.str();
}

/*  divisor(n)
    入力：整数 n
    出力：nのすべての約数
    計算量：O(√n)
*/
vector<long long> divisor(long long n) {
    vector<long long> ret;
    for (long long i = 1; i * i <= n; i++) {
        if (n % i == 0) {
            ret.push_back(i);
            if (i * i != n) ret.push_back(n / i);
        }
    }
    sort(ret.begin(), ret.end()); // 昇順に並べる
    return ret;
}

int main(void) {
    //cout << fixed << setprecision(10);
    ll N; cin >> N;
    vector<ll> A(N);
    vector<ll> in(N);
    map<ll,ll> cnt;
    map<ll, vector<ll>> G;
    rep(i, N) {
        cin >> A[i];
        vector<ll> d = divisor(A[i]);
        for (auto a : d) {
            G[a].pub(i);
            if (cnt.count(a)) {
                in[i] += cnt[a];
            }
        }
        cnt[A[i]]++;
    }
    queue<ll> que;
    vector<ll> dis(N, -1);
    ll ans = 1;
    rep(i, N) {
        if (in[i] == 0) {
            dis[i] = 1;
            que.push(i);
        }
    }
    while (!que.empty()) {
        ll v = que.front();
        que.pop();
        for (auto nv : G[A[v]]) {
            if (nv <= v) {
                continue;
            }
            else {
                chmax(dis[nv], dis[v] + 1);
                chmax(ans, dis[nv]);
                in[nv]--;
                if (in[nv] == 0) {
                    que.push(nv);
                }
            }
        }
    }
    cout << ans << endl;
}