#include <bits/stdc++.h>
long long gcd(long long a, long long b) {
  while (a && b) {
    if (a > b)
      a %= b;
    else
      b %= a;
  }
  return a + b;
}
long long lcm(long long a, long long b) { return (((a * b) / gcd(a, b))); }
int phi(int n) {
  int result = n;
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      while (n % i == 0) n /= i;
      result -= result / i;
    }
  }
  if (n > 1) result -= result / n;
  return result;
}
int catalan(unsigned int n) {
  int c[100];
  c[0] = c[1] = 1;
  for (int i = (int)(2); i < (int)(n); ++i) {
    for (int k = (int)(0); k < (int)(i); ++k) c[i] += c[k] * c[i - 1 - k];
  }
  return c[n];
}
using namespace std;
int n, a[1000100];
int dp[1000100];
int last = 0;
bool u[1000100];
int main() {
  {
    cin >> n;
    for (int i = 0; i < (int)(n); i++) scanf("%d", a + i);
    int mx = 0;
    for (int i = 0; i < n; ++i) {
      int ans = 1;
      long long x = a[i];
      if (x == 1) ans = max(ans, dp[1] + 1);
      for (long long j = 2; j * j <= x; ++j) {
        if (x % j) continue;
        while (x % j == 0) x /= j;
        ans = max(ans, dp[j] + 1);
      }
      if (x > 1) ans = max(ans, dp[x] + 1);
      x = a[i];
      if (x == 1) dp[1] = ans;
      for (long long j = 2; j * j <= x; ++j) {
        if (x % j) continue;
        while (x % j == 0) x /= j;
        dp[j] = ans;
      }
      if (x > 1) dp[x] = max(dp[x], ans);
    }
    for (int i = 0; i < (int)(1000100); i++) mx = max(mx, dp[i]);
    cout << mx << endl;
  }
  return 0;
}
