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

using namespace std;

int n;
int a[111111];
int dp[111111];
bool is_p[1111111];
vector<int> lis;

int solve(int p) {
  // int it = lower_bound(a+p, a+n, a[p]*2) - a;
  if (dp[p] >= 0) return dp[p];
  // printf("%d %d\n", p, it);
  int res = 1;
  // for (int i = it; i < n; i++) {
  for (size_t i = 0; i < lis.size(); i++) {
    int it = lower_bound(a+p, a+n, a[p]*lis[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("%d", a+i);

  for (int i = 2; i*i <= 1000000; i++) {
    if (!is_p[i]) {
      for (int j = i*i; j <= 1000000; j+=i) {
        is_p[j] = true;
      }
    }
  }
  for (int i = 2; i < 1000000; i++) {
    if (!is_p[i]) {
      lis.push_back(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;
}