#include<bits/stdc++.h>
using namespace std;
constexpr int Inf = 1000000010;
constexpr long long INF= 2000000000000000000;

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

template<typename T,typename U>
T modpow(T N, U P, T M = -1) {
    if(P < 0) return 0;
    T ret = 1;
    if(M != -1) ret %= M;
    while(P) {
        if(P & 1) {
            if(M == -1) ret *= N;
            else ret = ret * N % M;
        }
        P /= 2;
        if(M == -1) N *= N;
        else N = N * N % M;
    }
    return ret;
}

constexpr long long MOD = 998244353;

int main() {
    int n;
    cin >> n;
    vector<int> vec(n);
    for(auto& x: vec) cin >> x;

    vector<int> dp(n);
    map<int,int> ma;
    for(int i = 0;i < n;i++) {
        for(int j = 1;j * j <= vec[i];j++) {
            if(vec[i] % j == 0) {
                if(ma.count(j)) chmax(dp[i],ma[j] + 1);
                if(ma.count(vec[i] / j)) chmax(dp[i],ma[vec[i] / j] + 1);
            }
        }
        if(dp[i] == 0) dp[i] = 1;
        chmax(ma[vec[i]],dp[i]);
    }

    cout << *max_element(dp.begin(),dp.end()) << endl;
}