// yuki 979 Longest Divisor Sequence
// 2020.2.26 bal4u

#include <stdio.h>
#include <string.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;
}

#define MAX  300500
#define SQRT 548
char prime[MAX+5] = { 0,0,1,1,0 };
void sieve() {
	int i, j;
	memset(prime, 1, sizeof(prime));
	prime[0] = prime[1] = 0;
	for (i = 4; i <= MAX; i+=2) prime[i] = 0;
	for (i = 3; i <= SQRT; i += 2) if (prime[i]) {
		for (j = i*i; j <= MAX; j += i) prime[j] = 0;
	}
}

#define MAX 300500
int tbl[MAX+5];
int sqr[MAX+5] = {0,1,1,1,2};
int ans = 1;

int f;
void calc(int a) {
	int ma = f;
	int i, b = sqr[a];
	for (i = 2; i <= b; ++i) {
		if (a % i == 0) {
			if (tbl[i] > ma) ma = tbl[i];
			if (tbl[a/i] > ma) ma = tbl[a/i];
		}
	}
	if (++ma > tbl[a]) {
		tbl[a] = ma;
		if (ma > ans) ans = ma;
	}
}

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

	sieve();
	k = 4; for (i = 1; i < SQRT; ++i) {
		int j, t;
		j = t = (i+1)*(i+1);
		while (--j >= k) sqr[j] = i;
		k = t;
	}

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