#ifndef SHO_LOCAL
#include <bits/stdc++.h>
#define debug(...) ;
#else
#include "debug.h"
#endif
using namespace std;
using ll = long long;

const int N = (int)1e5 + 10;

int main() {
  iostream::sync_with_stdio(0), cin.tie(0);

  int n;
  cin >> n;
  vector<int> A(n);
  for (int i = 0; i < n; i++) {
    cin >> A[i];
  }

  int ans = 1;

  vector<int> cnt(N, -1);
  set<pair<int, int>> pos;
  vector<int> prev(N, -1);

  for (int i = n - 1; i >= 0; i--) {
    int a = A[i];
    if (cnt[a] == -1) {
      cnt[a] = 1;
      int mx = 0;
      int now = a + a;
      while (now < N) {
        mx = max(mx, cnt[now]);
        now += a;
      }
      cnt[a] += mx;
    } else {
      int mx = cnt[a] + 1;
      int now = a + a;
      auto it = pos.lower_bound(make_pair(now, i + 1));
      int j = prev[a];
      while (it != pos.end() && it->second < j) {
        if (it->first % a == 0) {
          mx = max(mx, cnt[it->first] + 1);
        }
        now += a;
        it = pos.lower_bound(make_pair(now, i));
      }
      cnt[a] = mx;
    }
    prev[a] = i;
    pos.emplace(a, i);
    ans = max(ans, cnt[a]);
  }
  cout << ans << '\n';

  return 0;
}