#include <bits/stdc++.h>
using namespace std;
const int MX = 1 * 1e5 + 10;
const double PI = acos(-1.0), EPS = 1e-9;
int N, k;
int arr[MX];
int dp[MX];
int best[MX];
vector<int> fact;
int p[MX];
vector<int> ff(int n) {
  fact.clear();
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0) fact.push_back(i);
    while (n % i == 0) {
      n /= i;
    }
  }
  if (n > 1) fact.push_back(n);
  sort(fact.begin(), fact.end());
  fact.resize(unique(fact.begin(), fact.end()) - fact.begin());
  return fact;
}
int main() {
  cin >> N;
  for (int i = 0; i < N; i++) cin >> arr[i];
  p[0] = p[1] = 1;
  for (int i = 2; i < MX; i++) {
    if (p[i]) continue;
    for (int j = i + i; j < MX; j += i) p[j]++;
  }
  for (int i = 0; i < N; i++) {
    if (!p[arr[i]]) {
      best[arr[i]] = 1;
      continue;
    }
    fact = ff(arr[i]);
    int mx = 0;
    for (int j = 0; j < fact.size(); j++) {
      best[fact[j]]++;
      mx = max(mx, best[fact[j]]);
    }
    for (int j = 0; j < fact.size(); j++) best[fact[j]] = mx;
  }
  int ans = 1;
  for (int i = 0; i < MX; i++) ans = max(ans, best[i]);
  cout << ans << "\n";
  return 0;
}
