#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include<iomanip>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
using Data = pair<ll, vector<int>>;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };


int dp[1000010];
vector<int> devisor(ll n) {
	vector<int>dev;
	for (ll i = 1; i*i <= n; i++) {
		if (n%i == 0) {
			if (i == n / i) {
				dev.push_back(i);
			}
			else {
				dev.push_back(i);
				dev.push_back(n / i);
			}
		}
	}
	return dev;
}

int main() {
	int n;
	cin >> n;
	vector<int>x(n);
	rep(i, 0, n)cin >> x[i];
	sort(all(x));

	rep(i, 0, n)dp[x[i]]++;

	rep(i, 0, 1000010) {
		if (!dp[i])continue;
		vector<int>s = devisor(i);
		fore(j, s) {
			if (j == i)continue;
			dp[i] = max(dp[j]+1,dp[i]);
		}
	}


	int ans = -1;
	rep(i, 0, 1000010) {
		if (dp[i])ans = max(ans,dp[i]);
	}
	cout << ans << endl;


	return 0;
}