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

using namespace std;

int n;
int a[111111];

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

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

  sort(a, a+n);

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

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