#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define RT return
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;

vector<int> divisors(int n) {
    vector<int> res;
    for (int i = 1; (long long)i*i <= n; ++i) {
        if (n%i == 0) {
            res.push_back(i);
            int j = n / i;
            if (j != i)res.push_back(j);
        }
    }
    return res;
}

void solve() {
    int N;
    cin >> N;
    vi A(N);
    rep(i, N) {
        cin >> A[i];
    }

    const int UB = 300001;
    vi dp(UB, -2*UB);

    for (int i = N - 1; i >= 0; --i) {
        int a = A[i];
        vi ds = divisors(a);
        smax(dp[a], 0);
        each(d, ds) {
            if (d != a) {
                smax(dp[d], dp[a] + 1);
            }
        }
        smax(dp[0], dp[a] + 1);
    }

    cout << *max_element(all(dp)) << endl;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}