#include <bits/stdc++.h>
using namespace std;
const int ppr = 257;
const long long INF = 1e18;
const int inf = 1e9;
const int mod = 1e9 + 7;
const int N = 2e5 + 123;
const long double pi = 3.141592653589793238462643;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
int n, x, dp[N], mx, ans;
vector<int> v;
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> x;
    for (int j = 2; j * j <= x; j++)
      if (x % j == 0) {
        while (x % j == 0) x /= j;
        v.push_back(j);
        mx = max(mx, dp[j]);
      }
    if (x > 1) {
      v.push_back(x);
      mx = max(mx, dp[x]);
    }
    for (int j = 0; j < v.size(); j++) dp[v[j]] = mx + 1;
    ans = max(ans, mx + 1);
    v.clear();
    mx = 0;
  }
  cout << ans;
  return 0;
}
