// yuki 979 Longest Divisor Sequence
// 2020.2.26 bal4u

#include <stdio.h>
#include <math.h>

int getchar_unlocked(void);
#define gc() getchar_unlocked()

int in() {  // 整数の入力
	int n = 0; int c = gc();
	do n = 10*n + (c & 0xf), c = gc(); while (c >= '0');
	return n;
}

int tbl[300005];
int ans = 1;

void count(int a, int b, int c) {
	if (tbl[a] <= tbl[b]) {
		tbl[a] = tbl[b]+1;
		if (tbl[a] > ans) ans = tbl[a];
	}
	if (c == b) return;
	if (tbl[a] <= tbl[c]) {
		tbl[a] = tbl[c]+1;
		if (tbl[a] > ans) ans = tbl[a];
	}
}
void calc(int a) {
	int i, b = sqrt(a);
	if (tbl[1]) count(a, 1, 1);
	for (i = 2; i <= b; ++i) {
		if (a % i == 0) count(a, i, a/i);
	}
}

int main()
{
	int i, N, A;

	N = in();
	while (N--) {
		A = in();
		if (tbl[A] == 0) tbl[A] = 1;
		if (A > 1) calc(A);
	}
	printf("%d\n", ans);
	return 0;
}