#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvv vector<vvl>
#define vvi vector<vector<int> >
#define vvl vector<vector<ll> >
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvvl(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define rep(c, a, b) for(ll c=a;c<b;c++)
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

int main(int argc, char const *argv[]) {
  ll ans = 0, n;std::cin >> n;
  vll dp(300001, 0), a(n);
  re(i, n) std::cin >> a[i];
  for(int i=n-1;i>=0;i--){
    ll t = dp[a[i]]+1;
    ans = max(ans, t);
    for(int j=2;j*j<=a[i];j++){
      if(a[i]%j==0){
        dp[j] = max(dp[j], t);
        dp[a[i]/j] = max(dp[a[i]/j], t);
      }
    }
    if(a[i]!=1) dp[1] = max(dp[1], t);
  }
  std::cout << ans << '\n';
  return 0;
}