#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int64_t> xs(n);
    for (auto &x : xs) {
        cin >> x;
    }
    sort(xs.begin(), xs.end());
    vector<int64_t> dp(n, 1);
    for (int i = n - 1; 0 <= i; i--) {
        int64_t x = xs[i];
        if (x == 1) {
            continue;
        }
        for (int64_t d = 1; d * d <= x; d++) {
            if (x % d == 0) {
                auto itr = lower_bound(xs.begin(), xs.end(), d);
                if (*itr == d) {
                    int j = distance(xs.begin(), itr);
                    dp[j] = max(dp[j], dp[i] + 1);
                }
                itr = lower_bound(xs.begin(), xs.end(), x / d);
                if (*itr == x / d) {
                    int j = distance(xs.begin(), itr);
                    dp[j] = max(dp[j], dp[i] + 1);
                }
            }
        }
    }
    cout << *max_element(dp.begin(), dp.end()) << endl;
    return 0;
}