#include <bits/stdc++.h>
using namespace std;
long long add(long long a, long long b) {
  a %= 1000000007;
  b %= 1000000007;
  long long res = ((a % 1000000007) + (b % 1000000007)) % 1000000007;
  return res % 1000000007;
}
long long mul(long long a, long long b) {
  long long res = (a) * (b);
  res %= 1000000007;
  if (res < 0) res += 1000000007;
  return res;
}
const long long N = 1e5 + 2;
long long f[N];
void solve() {
  long long n;
  cin >> n;
  vector<long long> v(n);
  for (long long i = 0; i < n; i++) cin >> v[i];
  for (auto r : v) {
    long long temp = 1;
    for (long long i = 1; i * i <= r; i++) {
      if (r % i == 0) {
        if (i != 1) temp = max(temp, f[i] + 1);
        if (r / i != 1) temp = max(temp, f[r / i] + 1);
      }
    }
    for (long long i = 1; i * i <= r; i++) {
      if (r % i == 0) {
        f[i] = max(f[i], temp);
        f[r / i] = max(temp, f[r / i]);
      }
    }
  }
  long long ans = 0;
  for (long long i = 0; i < 1e5 + 1; i++) {
    ans = max(ans, f[i]);
  }
  cout << ans << "\n";
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t = 1;
  while (t--) {
    solve();
  }
}
