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

void solve() {
    int n;
    std::cin >> n;

    std::vector<int> xs(n);
    for (auto& x : xs) std::cin >> x;
    std::sort(xs.rbegin(), xs.rend());

    std::map<int, int> pos;
    for (int i = 0; i < n; ++i) pos[xs[i]] = i;

    std::vector<int> dp(n, 1);
    for (int i = 0; i < n; ++i) {
        auto x = xs[i];

        for (int y = x * 2; y <= xs.front(); y += x) {
            if (!pos.count(y)) continue;
            dp[i] = std::max(dp[i], dp[pos[y]] + 1);
        }
    }

    std::cout << *std::max_element(dp.begin(), dp.end()) << "\n";
}

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

    solve();

    return 0;
}