/* -*- coding: utf-8 -*-
 *
 * 390.cc: No.390 最長の数列 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;
const int MAX_X = 1000000;

/* typedef */

/* global variables */

int xs[MAX_N], dp[MAX_X + 1];

/* subroutines */

/* main */

int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> xs[i];
  sort(xs, xs + n);

  for (int i = 0; i < n; i++) {
    int xi = xs[i], maxd = 1;

    for (int a = 1; a * a <= xi; a++)
      if (xi % a == 0) {
	int da = dp[a] + 1;
	if (maxd < da) maxd = da;
	int b = xi / a;
	if (b != a) {
	  int db = dp[b] + 1;
	  if (maxd < db) maxd = db;
	}
      }

    dp[xi] = maxd;
  }

  int maxd = 0;
  for (int i = 0; i < n; i++)
    if (maxd < dp[xs[i]]) maxd = dp[xs[i]];
  printf("%d\n", maxd);
  return 0;
}