#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> pos(N, -1);
  vector<int> dp(n);

  for (int i = 0; i < n; i++) {
    dp[i] = 1;
    int a = A[i];
    for (int d = 1; d * d <= a; d++) {
      if (a % d)
        continue;
      int p1 = pos[d];
      int p2 = pos[a / d];
      int a = p1 != -1 ? dp[p1] + 1 : 0;
      int b = p2 != -1 ? dp[p2] + 1 : 0;
      dp[i] = max({dp[i], a, b});
    }
    pos[a] = i;
    ans = max(ans, dp[i]);
  }
  cout << ans << '\n';

  return 0;
}