#include <bits/stdc++.h>
int hash[1000006], a[1000006], pr[1000006], hash2[1000006], temp[1000006];
int main() {
  int i, n, j, c, max, k;
  scanf("%d", &n);
  for (i = 0; i < n; i++) scanf("%d", &a[i]);
  for (i = 0; i < 100006; i++) hash[i] = 1;
  hash[0] = hash[1] = 0;
  c = 0;
  for (i = 2; i < 100006; i++) {
    if (hash[i] == 1) {
      pr[c++] = i;
      for (j = i; j < 100006; j = j + i) hash[j] = 0;
    }
  }
  for (i = 0; i < 100006; i++) hash2[i] = 0;
  for (i = 0; i < c; i++) hash2[pr[i]] = 1;
  for (i = 0; i < 100006; i++) hash[i] = 0;
  for (i = 0; i < n; i++) {
    if (hash2[a[i]] == 1 || a[i] == 1)
      hash[a[i]]++;
    else {
      j = 0;
      k = 0;
      while (pr[j] <= a[i] / 2) {
        if (a[i] % pr[j] == 0) temp[k++] = pr[j];
        j++;
      }
      max = 0;
      for (j = 0; j < k; j++) {
        if (max < hash[temp[j]]) max = hash[temp[j]];
      }
      for (j = 0; j < k; j++) {
        hash[temp[j]] = max + 1;
      }
    }
  }
  max = 0;
  for (i = 0; i < 100006; i++) {
    if (hash[i] > max) max = hash[i];
  }
  printf("%d", max);
  return 0;
}
