#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int,int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)

int dp[1000000];

int main(void){
	int n; cin >> n;
	rep(i, 1000000) dp[i] = 0;
	vector<int> x(n);
	rep(i, n){
		scanf("%d", &x[i]);
	}
	sort(all(x));
	dp[x[0]] = 1;
	// rep(i, n) printf("%d\n", x[i]);
	int MX = 1;
	reps(i, 1, n){
		int now = x[i];
		for (int i = now - 1; i >= 1; --i){
			if(now % i == 0){
				dp[now] = max(dp[i] + 1, dp[now]);
				if(dp[i] == MX){
					MX = max(MX, dp[now]);

					continue;
				}
			}
		}
		
		/*
		for (int i = 1; i < now; ++i){
			if(now % i == 0)
				dp[now] = max(dp[i] + 1, dp[now]);
		}
		*/
	}
	/*
	rep(i, 100000){
		if(dp[i] != 0){
			printf("dp %d i %d\n", dp[i], i);
		}
	}
	*/
	int ans = 0;
	rep(i, 1000000){
		ans = max(dp[i], ans);
	}
	printf("%d\n", ans);
	
	return 0;
}