// yukicoder: No.390 最長の数列
// 2019.5.6 bal4u

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

#if 1
#define gc() getchar_unlocked()
#define pc(c) putchar_unlocked(c)
#else
#define gc() getchar()
#define pc(c) putchar(c)
#endif
int in()    // 非負整数の入力
{
	int n = 0, c = gc();
	do n = 10 * n + (c & 0xf), c = gc(); while (c >= '0');
	return n;
}

int x[100005], N;
int dp[100005];
int f[1000005];

int cmp(const void *a, const void *b) { return *(int *)a - *(int *)b; }

int main()
{
	int i, j, k, b, t, ans;

	N = in();
	for (i = 1; i <= N; i++) x[i] = in();
	qsort(x+1, N, sizeof(int), cmp);
	for (i = 1; i <= N; i++) f[x[i]] = i;

	for (i = N; i > 1; i--) {
		k = x[i], b = (int)sqrt(k);
		for (j = 1; j <= b; j++) {
			if (k % j == 0) {
				if (f[j] && dp[i]+1 > dp[f[j]]) dp[f[j]] = dp[i]+1;
				if (j > 1) {
					t = k/j;
					if (f[t] && dp[i]+1 > dp[f[t]]) dp[f[t]] = dp[i]+1;
				}
			}
		}
	}
	ans = 0; for (i = 1; i <= N; i++) if (dp[i] > ans) ans = dp[i];
	printf("%d\n", ans+1);
	return 0;
}