#include <bits/stdc++.h>

using namespace std;

const int N = 300000;
int dp[N+1];
vector<int> divisor[N+1];

int main() {
  ios_base::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];

  for (int i = 1; i <= N; i++) {
    for (int j = 1; i*j <= N; j++)
      divisor[i*j].push_back(i);
  }

  for (int x: a) {
    int mx = 0;
    for (int d: divisor[x]) {
      if (d < x) {
        mx = max(mx, dp[d]);
      }
    }
    dp[x] = ++mx;
  }

  cout << *max_element(dp, dp + N + 1) << endl;
  
  
  return 0;
}