#include <bits/stdc++.h>

using namespace std;

using ll = long long;

deque<int> memo[300005];

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;

    int maxa = 0;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        memo[a[i]].push_back(i);
        maxa = max(maxa, a[i]);
    }

    vector<int> dp(n, 1);
    for (int i = 0; i < n; ++i) {
        memo[a[i]].pop_front();
        for (int j = a[i] * 2; j <= maxa; j += a[i]) {
            if (!memo[j].empty()) {
                dp[memo[j].front()] = max(dp[memo[j].front()], dp[i] + 1);
            }
        }
    }

    int ans = 0;
    for (int i = 0; i < n; ++i) {
        ans = max(ans, dp[i]);
    }
    cout << ans << "\n";
    return 0;
}