#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;

vl pl;
bool is_prime(ll a){
  if(a < 2)return false;
  each(itr, pl)if(a%*itr == 0)return false;
  return true;
}
void divisor(ll a, vl&v){
  map<ll, int> m;
  v.resize(0);
  v.pb(1);
  for(vl::iterator itr = pl.begin(); *itr * *itr <= a; itr++){
    if(a%*itr == 0){
      ll b = 1, vs = sz(v);
      while((a%*itr) == 0){
        a /= *itr;
        b *= *itr;
        FOR(j, 0, vs)v.pb(v[j] * b);
      }
    }
  }
  ll vs = sz(v);
  if(a > 1)FOR(j, 0, vs)v.pb(v[j] * a);
  v.pop_back();
}
ll n, x[100000];
map<ll, int> m;
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  pl.pb(2);
  for(int i = 3; i < 1100; i+= 2) if(is_prime(i)) pl.pb(i);
  cin >> n;
  FOR(i, 0, n) cin >> x[i];
  sort(x, x+n);
  int ans = 0;
  FOR(i, 0, n){
    vl v;
    int ma = 0;
    divisor(x[i], v);
    each(itr, v){
      if(m.find(*itr) == m.end())continue;
      maxs(ma, m[*itr]);
    }
    ma++;
    m[x[i]] = ma;
    maxs(ans, ma);
  }
  cout << ans << endl;
}