#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

using ll = long long;

int main() {
    int N;
    cin >> N;
    vector<int> A(N);
    for (int i = 0; i < N; i++) {
        cin >> A[i];
    }
    vector<vector<int>> divs(300001);
    for (int i = 1; i <= 300000; i++) {
        for (int j = i; j <= 300000; j += i) {
            divs[j].push_back(i);
        }
    }
    vector<int> len(300001);
    for (int i = 0; i < N; i++) {
        len[A[i]] = max(len[A[i]], 1);
        for (int d : divs[A[i]]) {
            if (d < A[i]) {
                len[A[i]] = max(len[A[i]], len[d] + 1);
            }
        }
    }
    int ans = 0;
    for (int i = 1; i <= 300000; i++) {
        ans = max(ans, len[i]);
    }
    cout << ans << endl;
}