#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  vector<int>v(n + 1);
  int nax = 0;
  for (int i = 1 ; i <= n; i++) {
    cin >> v[i];
    nax = max(nax, v[i]);
  }
  nax += 10;
  sort(v.begin(), v.end());
  vector<int>dp(nax + 1, 0);
  for (int i = 1; i <= n; i++) {
    dp[v[i]] = 1;
  }
  for (int i = 1; i < nax; i++) {
    if (dp[i] == 0)continue;
    for (int j = 2 * i; j < nax; j += i) {
      if (dp[j] >= 1) {
        dp[j] = max(dp[j], 1 + dp[i]);
      }
    }
  }
  int ans = 0;
  for (int i = 0; i <= nax; i++) {
    ans = max(ans, dp[i]);
  }
  cout << ans << endl;
}