#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, string> pls;

#define MAX_N 1000000

int n;
int x[100010];
int dp[1000010];

vector<ll> enumdiv(ll n) {
	vector<ll> s;
	for (ll i = 1; i*i <= n; i++) {
		if (n % i == 0) {
			s.push_back(i);
			if (i*i != n)
				s.push_back(n / i);
		}
	}
	sort(s.begin(),s.end());
	return s;
}

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

	for (int i = 0; i < n; i++)
		dp[x[i]] = 1;

	for (int i = 1; i < 1000001; i++) {
		if (dp[i]) {
			auto  v = enumdiv(i);
			for (int j : v) {
				if (j != i)
					dp[i] = max(dp[i],dp[j]+1);
			}
		}
	}

	int ans = 0;
	for (int i = 0; i < n; i++)
		ans = max(ans,dp[x[i]]);
	cout << ans << endl;
	return 0;
}