#include <bits/stdc++.h>
using namespace std;
int n, m, i, j, k, l, o, p, a[100010], x[100010], b[100010], mx, mm, u;
vector<int> v;
int main() {
  scanf("%d", &n);
  for (i = 0; i < n; i++) scanf("%d", &a[i]);
  u = a[n - 1];
  for (i = 2; i <= 100000; i++) {
    if (b[i] == 0)
      for (j = i + i; j <= 100000; j += i)
        if (b[j] == 0) b[j] = i;
  }
  for (i = 0; i < n; i++) {
    mx = -1;
    p = -1;
    while (b[a[i]] != 0) {
      v.push_back(b[a[i]]);
      if (x[b[a[i]]] > mx) mx = x[b[a[i]]];
      a[i] = a[i] / b[a[i]];
    }
    v.push_back(a[i]);
    if (x[a[i]] > mx) mx = x[a[i]];
    while (!v.empty()) {
      x[v.back()] = mx + 1;
      v.pop_back();
    }
  }
  for (i = 0; i <= a[n - 1]; i++) mm = max(mm, x[i]);
  cout << mm;
}
