#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
long long MOD = 1000000007;
long double EPS = 1e-9;
long long binpow(long long b, long long p, long long mod) {
  long long ans = 1;
  b %= mod;
  for (; p; p >>= 1) {
    if (p & 1) ans = ans * b % mod;
    b = b * b % mod;
  }
  return ans;
}
void pre() {}
long long dp[1000100];
void solve() {
  long long n;
  cin >> n;
  map<long long, long long> mp;
  for (long long i = 1; i <= n; ++i) {
    long long x;
    cin >> x;
    mp[x]++;
  }
  vector<pair<long long, long long> > temp((mp).begin(), (mp).end());
  reverse((temp).begin(), (temp).end());
  long long ans = 0;
  for (int i = 0; i < temp.size(); i++) {
    for (int j = 2 * temp[i].first; j <= 1000000; j += temp[i].first) {
      (dp[temp[i].first] = max((dp[temp[i].first]), (dp[j])));
    }
    dp[temp[i].first] += temp[i].second;
    (ans = max((ans), (dp[temp[i].first])));
  }
  cout << ans << '\n';
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  pre();
  long long _t = 1;
  for (long long i = 1; i <= _t; i++) {
    solve();
  }
}
