#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll max(ll a, ll b) { return (a > b ? a : b); }
ll min(ll a, ll b) { return (a > b ? b : a); }
ll a, b, c, d, e, n, m, k, q, x, y, z, w, t, cur, cnt, ma,
    mi = LONG_LONG_MAX, l, r, mid, sum, i, j, pro = 1, f;
double ans, slp;
ll arr[200005];
ll arr1[200005];
ll arr2[200005];
ll dp[200005];
ll arr3[1000][1000];
char carr[1000][1000];
vector<ll> adj[100001];
string s;
ll dfs(int i) {
  if (arr1[i]) a = 1;
  arr[i] = 1;
  int cnt = 1;
  for (auto c : adj[i]) {
    if (!arr[c]) cnt += dfs(c);
  }
  return cnt;
}
void solve() {
  cin >> n;
  for (ll i = 1; i <= 1e5; i++) {
    dp[i] = -1;
    arr1[i] = 1;
  }
  for (ll i = 1; i <= n; i++) scanf("%d", &arr[i]);
  for (ll i = 1; i <= n; i++) {
    for (int d = 2; d * d <= arr[i]; d++) {
      if (arr[i] % d == 0) {
        if (dp[d] != -1) arr1[i] = max(arr1[i], 1 + arr1[dp[d]]);
        if (dp[arr[i] / d] != -1)
          arr1[i] = max(arr1[i], 1 + arr1[dp[arr[i] / d]]);
        dp[d] = dp[arr[i] / d] = i;
      }
    }
    dp[arr[i]] = i;
    ma = max(ma, arr1[i]);
  }
  cout << ma;
}
int main() {
  cout.precision(9);
  ll t;
  t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
