#include <cstdio>
#include <algorithm>

using namespace std;

const int MAX_N = 100000;
const int MAX_X = 1000000;
int x[MAX_N], dp[MAX_X + 1] = {};

int main() {
    int n;
    scanf("%d", &n);
    int xmax = 0;
    for (int i = 0; i < n; i++) {
        scanf("%d", &x[i]);
        xmax = max(xmax, x[i]);
        dp[x[i]] = 1;
    }
    for (int i = 1; i <= xmax; i++) {
        if (dp[i] == 0) continue;
        for (int j = i * 2; j <= xmax; j += i) {
            if (dp[j] > 0) dp[j] = max(dp[j], dp[i] + 1);
        }
    }
    int res = 0;
    for (int i = 0; i < n; i++) res = max(res, dp[x[i]]);
    printf("%d\n", res);
    return 0;
}