// #include <bits/stdc++.h>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <functional>

using namespace std;

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)

int n;
int x[125252];
int dp[1<<20];

int main(){
  vector<bool> has(1<<20,false);
  int ans = 1;

  scanf("%d",&n);
  REP(i,n){
    scanf("%d",x+i);
    has[x[i]] = true;
  }
  sort(x,x+n,greater<int>());
  REP(i,n){
    int y = x[i];
    int it = y;
    if(dp[y]==0)dp[y]=1;
    for(int it=2*y;it<(1<<20);it+=y){
      if(!has[it])continue;
      if(dp[y]<=dp[it])dp[y]=dp[it]+1;
    }
    if(ans<dp[y])ans=dp[y];
  }
  printf("%d\n",ans);
  return 0;
}