#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

int n;
int x[125252];
int dp[1252525];

int main(){
  scanf("%d",&n);
  REP(i,n)scanf("%d",x+i);
  sort(x,x+n);
  int ans = 1;
  REP(i,n){
    int y = x[i];
    // dp[y] = 1;
    for(int j=1;j*j<=y;++j){
      if(y%j!=0)continue;
      CHMAX(dp[y],dp[j]+1);
      if(j==y/j)continue;
      if(j==1)continue;
      CHMAX(dp[y],dp[y/j]+1);
    }
    CHMAX(ans,dp[y]);
  }
  printf("%d\n",ans);
  return 0;
}