#include <bits/stdc++.h>
using namespace std;
int a[100010];
int dp[100010];
int n;
bool vis[1001];
int p[1001], pn = 0;
int addr[100010];
int f[11], fn;
void fen(int x) {
  fn = 0;
  for (int i = 0; i < pn; i++)
    if (x % p[i] == 0) {
      f[fn++] = p[i];
      while (x % p[i] == 0) x /= p[i];
    }
  if (x != 1) f[fn++] = x;
  return;
}
void update_addr(int pos) {
  fen(a[pos]);
  for (int i = 0; i < fn; i++)
    if (addr[f[i]] == -1 || dp[pos] > dp[addr[f[i]]]) addr[f[i]] = pos;
}
int get_val(int pos) {
  fen(a[pos]);
  int ret = 1;
  for (int i = 0; i < fn; i++)
    if (addr[f[i]] != -1) ret = max(ret, dp[addr[f[i]]] + 1);
  return ret;
}
int main() {
  for (int i = 2; i <= 1000; i++)
    if (!vis[i]) {
      for (int j = i + i; j <= 1000; j += i) vis[j] = 1;
    }
  for (int i = 2; i <= 1000; i++)
    if (!vis[i]) p[pn++] = i;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  memset(addr, -1, sizeof(addr));
  dp[0] = 1;
  int ans = 1;
  for (int i = 1; i < n; i++) {
    update_addr(i - 1);
    dp[i] = get_val(i);
    ans = max(ans, dp[i]);
  }
  cout << ans << endl;
  return 0;
}
