#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    ll N, ans=0;
    cin >> N;
    vector<ll> A(N);
    for (int i=0; i<N; i++) cin >> A[i];
    vector<vector<ll>> v(1e5+1);
    for (int i=1; i<=1e5; i++){
        for (int j=i; j<=1e5; j+=i){
            v[j].push_back(i);
        }
    }

    vector<ll> dp(1e5+1, -1e18);
    dp[1] = 0;

    for (int i=0; i<N; i++){
        ll mx=-1e18;
        for (auto x : v[A[i]]){
            mx = max(mx, dp[x]);
        }
        dp[A[i]] = mx+1;
    }

    for (int i=1; i<=1e5; i++) ans = max(ans, dp[i]);

    cout << ans << endl;

    return 0;
}