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

int main() {
    int N;
    cin >> N;
    vector<int> A(N);
    for (int i = 0; i < N; i++) cin >> A[i];
    sort(A.begin(), A.end());

    vector<int> dp(1000001, -1);
    for (int i = 0; i < N; i++) dp[A[i]] = 1;
    for (int i = 0; i < N; i++) {
        for (int j = 2*A[i]; j <= 1000000; j += A[i]) {
            if (dp[j] != -1) dp[j] = max(dp[j], dp[A[i]]+1);
        }
    }

    int M = -1;
    for (int i = 0; i < dp.size(); i++) M = max(M, dp[i]);
    cout << M << endl;
}