#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;

vector<int> divisor(int n){
  vector<int> ret;
  for(int i=1; i*i<=n; i++){
    if(n%i==0){
      ret.push_back(i);
      if(i!=n/i) ret.push_back(n/i);
    }
  }
  //sort(ret.begin(), ret.end());
  return ret;
}

int main(){
  ios::sync_with_stdio(false);
  
  int N;
  cin >> N;

  unordered_map<int,int> m;
  rep(i,N){
    int a;
    cin >> a;

    vector<int> v = divisor(a);
    int mx = 0;
    rep(j,v.size()){
      if(v[j] == a) continue;
      
      if(m.count(v[j])!=0){
        mx = max(mx, m[v[j]]);
      }
    }
    m[a] = max(m[a], mx+1);
  }

  int ret = 0;
  FOR(it,m){
    ret = max(ret, it->second);
  }
  
  cout << ret << endl;
  
  return 0;
}