#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}

void f(ll now, ll cnt, vvl& G, vll& dist){
  dist[now] = max(cnt, dist[now]);
  for(auto to:G[now]) f(to, cnt+1, G, dist);
}
int main() {
  ll n;std::cin >> n;
  vvl G = VV(n, 0, 0, ll);
  vll idx(1000001, -1);
  vll a(n);
  get(a);
  sort(all(a));
  re(i, n) idx[a[i]] = i;
  re(i, n){
    for(ll j=2*a[i];j<=1000000;j+=a[i]){
      if(i>=idx[j]) continue;
      G[i].push_back(idx[j]);
    }
  }
  vll dist(n, 1);
  ll ans = 0;
  for(int i=0;i<n;i++){
    if(dist[i]==1) f(i, 1, G, dist);
    ans = max(ans, dist[i]);
  }
  std::cout << ans << '\n';
}