// Problem: No.2218 Multiple LIS No.2218 多重LIS
// Contest: yukicoder
// URL: https://yukicoder.me/problems/no/2218
// Memory Limit: 512 MB
// Time Limit: 3000 ms

#include <bits/stdc++.h>

#define fastio ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define dbg(x) cout << #x << " = " << (x) << "\n";
#define popcount(x) __builtin_popcountll((x))
#define all(v) (v).begin(), (v).end()
#define pb emplace_back
#define x first
#define y second

using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;

const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;

const int N = 1e5 + 7;
ll dp[N], a[N];
ll n;

void solve() {
  cin >> n;
  ll ans = 0;
  for (ll i = 1; i <= n; i++) {
    cin >> a[i];
    ll mx = 0;
    for (ll j = 1; j * j <= a[i]; j++) {
      if (a[i] % j == 0) {
        ll x = j, y = a[i] / j;
        mx = max(dp[x], mx);
        mx = max(dp[y], mx);
      }
    }
    dp[a[i]] = max(mx + 1, dp[a[i]]);
    ans = max(dp[a[i]], ans);
  }
  cout << ans << "\n";
}

int main() {
  fastio;
  int t = 1;
  // cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}