// I SELL YOU...! 
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
#define MAX_N 310000
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
vector<ll> a(MAX_N),dp(MAX_N),idx[MAX_N];
void init_io(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << setprecision(10);
}
vector< ll > divisor(ll n) {
  vector< ll > ret;
  for(ll i = 1; i * i <= n; i++) {
    if(n % i == 0) {
      ret.push_back(i);
      if(i * i != n) ret.push_back(n / i);
    }
  }
  sort(begin(ret), end(ret));
  return (ret);
}
signed main(){
  init_io();
  ll n;
  cin >> n;
  dp[0] = 1;
  for(int i=0;i<n;i++){
    cin >> a[i];
    idx[a[i]].push_back(i);
  }
  ll ans = 1;
  vector<ll> divi;
  for(ll i=1;i<n;i++){
    divi = divisor(a[i]);
    ll great = 0;
    for(auto v:divi){
      if(idx[v].size()==0)continue;
      if(v==a[i]) continue;
      auto itr = lower_bound(idx[v].begin(),idx[v].end(),i);
      if(itr==idx[v].begin()&&*itr>=i) continue;
      itr--;
      ll d = *itr;
      //cout << d<<" "<<v<<" "<<i<<endl;
      great = max(great,dp[d]);
    }
    dp[i] = great+1;
    ans = max(dp[i],ans);
    divi.clear();
  }
  cout << ans << endl;
}