#include <bits/stdc++.h>
using namespace std;
int good[100005], dp[100005], d[100005];
set<int> g;
void print(int n) {
  for (int i = 0; i <= n; i++) {
    cout << dp[i] << " ";
  }
  cout << "\n";
  for (int i = 0; i <= 2 * n; i++) {
    cout << d[i] << " ";
  }
  cout << "\n\n";
}
int main() {
  int n;
  cin >> n;
  memset(dp, 0, sizeof(dp));
  memset(d, 0, sizeof(d));
  for (int i = 0; i < n; i++) {
    cin >> good[i];
  }
  int s;
  int rta = 0;
  for (int i = 0; i < n; i++) {
    vector<int> divs;
    s = sqrt(good[i]);
    for (int j = 1; j <= s; j++) {
      if (good[i] % j == 0) {
        if (j > 1) {
          divs.push_back(j);
          dp[i] = max(d[j] + 1, dp[i]);
        }
        if (j * j != good[i]) {
          divs.push_back(good[i] / j);
          dp[i] = max(d[good[i] / j] + 1, dp[i]);
        }
      }
    }
    dp[i] = max(dp[i], 1);
    for (auto x : divs) {
      d[x] = max(d[x], dp[i]);
    }
    rta = max(rta, dp[i]);
  }
  cout << rta << "\n";
}
