#include <bits/stdc++.h>
using namespace std;
int n;
int cant[100300];
int inf = 1 << 30;
int ct;
set<int> v;
int primes[100003];
int primo[100003];
set<int> todos[100300];
void criba() {
  memset(primes, -1, sizeof primes);
  primes[1] = 1;
  for (int i = 2; i <= 100000; i++) {
    if (primes[i] == -1) {
      for (int j = i; j <= 100000; j += i) {
        if (primes[j] == -1) primes[j] = i;
        todos[j].insert(i);
      }
      primes[i] = 1;
    }
  }
}
int arr[100300];
int main() {
  criba();
  cin >> n;
  for (int i = 0; i < n; i++) cin >> arr[i];
  int res = 1;
  set<int> primos;
  int p;
  for (int i = n - 1; i >= 0; i--) {
    int rr = 1;
    for (typeof todos[arr[i]].begin() it = todos[arr[i]].begin();
         it != todos[arr[i]].end(); it++) {
      p = *it;
      if (p == 1) continue;
      cant[p]++;
      if (cant[p] > rr) rr = cant[p];
    }
    for (typeof todos[arr[i]].begin() it = todos[arr[i]].begin();
         it != todos[arr[i]].end(); it++) {
      p = *it;
      if (p == 1) continue;
      cant[p] = rr;
    }
    res = max(res, rr);
  }
  cout << res << endl;
  return 0;
}
