#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;

const int kMAX_N = 100010;
const int kMAX_X = 1000010;

int N;
int a[kMAX_N], val_index[kMAX_X];
int dp[kMAX_N];

void Solve() {
    sort(a, a + N);
    memset(val_index, -1, sizeof(val_index));

    for (int i = 0; i < N; i++) {
        if (val_index[a[i]] < 0) {
            val_index[a[i]] = i;
        }
    }
    int ans = 0;
    for (int i = 0; i < N; i++) {
        dp[i] = max(dp[i], 1);
        for (int k = 2; a[i] * k < kMAX_X; k++) {
            if (val_index[a[i] * k] >= 0) {
                dp[val_index[a[i] * k]] = max(dp[val_index[a[i] * k]], dp[i] + 1);
            }
        }
        ans = max(ans, dp[i]);
    }
    cout << ans << endl;
}

int main() {
    cin >> N;

    for (int i = 0; i < N; i++) {
        cin >> a[i];
    }

    Solve();

    return 0;
}