#include <cstdio>
#include <algorithm>
#include <functional>
#include <vector>

using namespace std;

int n;
long long a[111111];
int dp[111111];

int solve(int p) {
  if (dp[p] >= 0) return dp[p];
  // printf("%d %d\n", p, it);
  int res = 1;
  for (size_t i = 2; i*a[p] <= 1000000; i++) {
    int it = lower_bound(a+p, a+n, a[p]*i) - a;
    if (it >= n) break;
    if (a[it]%a[p] == 0) {
      res = max(res, solve(it)+1);
    }
  }
  return dp[p] = res;
}

int main(void) {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%lld", a+i);

  sort(a, a+n);

  int res = 0;
  fill(dp, dp+n+1, -1);
  for (int i = 0; i < n; i++) {
    res = max(res, solve(i));
  }

  printf("%d\n", res);
  return 0;
}