#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000;
int n;
int D[MAXN + 3], a[MAXN + 3], p[MAXN + 3], stos[MAXN + 3];
void erato(int N) {
  int g = (int)sqrt(N);
  for (int i = 2; i <= g; i++)
    if (p[i] == 0) {
      p[i] = i;
      for (int k = i * i; k <= N; k += i)
        if (p[k] == 0) p[k] = i;
    }
  for (int i = 2; i <= N; i++)
    if (p[i] == 0) p[i] = i;
}
void dynamic() {
  for (int i = 1; i <= n; i++) {
    D[i] = 1;
    int k = a[i];
    while (k > 1) {
      int prime = p[k];
      if (stos[prime] && stos[prime] != i) D[i] = max(D[i], D[stos[prime]] + 1);
      stos[prime] = i;
      k /= prime;
    }
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  erato(a[n]);
  dynamic();
  int wyn = 0;
  for (int i = 1; i <= n; i++)
    if (D[i] > wyn) wyn = D[i];
  printf("%d\n", wyn);
  return 0;
}
