#include<cstdio>
#include<queue>
#include<utility>
#include<cstring>
#include<stack>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<map>
#include<set>
#define MAX_N 100001
#define INF_INT 2147483647
#define INF_LL 9223372036854775807
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
void init(int n);
int find(int n);
void unite(int x,int y);
bool same(int x, int y);
ll bpow(ll,ll,ll);
typedef vector<int> vec;
typedef vector<vec> mat;
mat mul(mat &A,mat &B);
mat pow(mat A,ll n);
int dx[4] = {1,0,0,-1};
int dy[4] = {0,1,-1,0};


bool cmp_P(const P &a,const P &b){
  return a.second < b.second;
}
int main()
{
  int N,I,res=1,dp[1000001];
  fill(dp,dp+1000001,-INF_INT);
  cin >> N;
  vector<int> x(N,0);
  set<int> sets;
  REP(i,N){
    cin >> x[i];
    sets.insert(x[i]);
  }
  sort(x.begin(),x.end());
  REP(i,N){
    dp[x[i]] = 0;
    vector<int> d(0);
    I = sqrt(x[i]);
    for(int j=1;j<=I;j++){
      if(!(x[i] % j)){
        if(sets.count(j)){
          d.push_back(j);
          
        }
        if(sets.count(x[i]/j))
          d.push_back(x[i]/j);
      }
    }
    sort(d.begin(),d.end());
    int s;
    for(int j=0;j<d.size();j++){
      s = max(max(s,0) , dp[d[j]] + 1);
   
    }
    dp[x[i]] = s;
    res = max(dp[x[i]],res);
   
  }
  cout << res << endl;
  return 0;
}