#include <bits/stdc++.h>

using namespace std;

const int mxN = 1e5 + 7;

int main() {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    vector<int> dp(mxN, 0);
    for (int i = 0; i < n; i++) {
        int mx = 1;
        vector<int> S;
        for (int j = 1; j * j <= a[i]; j++) {
            if (a[i] % j == 0) {
                S.push_back(j);
                if (j != a[i] / j) {
                    S.push_back(a[i] / j);
                }
            }
        }
        for (auto u : S) {
            mx = max(mx, dp[u] + 1);
        }
        dp[a[i]] = mx;
    }
    int ans = *max_element(dp.begin(), dp.end());
    cout << ans << endl;
}