#include <bits/stdc++.h>
using namespace std;
const int INF = (-1u) / 2;
const long long int INF2 = (-1ull) / 2;
int a, b, i, d[1011000], j, k, n, m, timer = 0, l, r, x, y;
int c[1011000], cnt = 0, fl = 0, a2, a3 = -1000000, ans = 0;
vector<int> v;
void deb(bool a) {
  if (a) return;
  printf("PROGRAM TERMINATED\n");
  exit(0);
}
int main() {
  scanf("%d", &n);
  for (i = 1; i <= n; i++) {
    scanf("%d", &c[i]);
    k = sqrt(c[i]);
    if (v.size()) v.clear();
    ans = 0;
    for (j = 1; j <= k; j++) {
      if (c[i] % j == 0) {
        v.push_back(j);
        if (j * j != c[i]) {
          v.push_back(c[i] / j);
        }
        if (j != 1) ans = max(ans, d[j]);
        ans = max(ans, d[c[i] / j]);
      }
    }
    for (j = 1; j < v.size(); j++) {
      d[v[j]] = max(d[v[j]], ans + 1);
    }
  }
  ans = 0;
  for (i = 2; i <= 100000; i++) {
    ans = max(ans, d[i]);
  }
  ans = max(ans, 1);
  printf("%d\n", ans);
  return 0;
}
