#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const long long MAX = 5100000;
const long long INF = 1LL << 60;
const long long mod = 1000000007LL;
//const long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;

int res[1000000];
int cnt[1000000];
int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/
	ll N; scanf("%lld", &N);
	vector<ll> a(N);
	for (ll i = 0; i < N; i++) {
		scanf("%lld", &a[i]);
		res[a[i]] = 1;
		cnt[a[i]]++;
	}
	for (ll i = N - 1; i >= 0; i--) {
		cnt[a[i]]--;
		for (ll j = 1; j * j <= a[i]; j++) {
			if (a[i] % j == 0) {
				if (j < a[i] && cnt[j] > 0) {
					chmax(res[j], res[a[i]] + 1);
				}
				if (j != a[i] / j && a[i] / j < a[i] && cnt[a[i]/j] > 0) {
					chmax(res[a[i] / j], res[a[i]] + 1);
				}
			}
		}
	}

	ll ans = 0;
	for (ll i = 0; i < 1000000; i++) chmax(ans, (ll)res[i]);
	cout << ans << endl;
	return 0;
}