#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;

vector<ll> dp;
ll N;
vector<ll> a;
ll id[1000500];
ll dfs(ll cur) {
	if (cur == N) return 0;
	if (dp[cur] != -1) return dp[cur];
	ll res = 1;
	for (ll i = 2; i <= 1000000; i++) {
		ll now = a[cur] * i;
		if (a.back() < now) break;
		if (id[now] >= 0) {
			chmax(res, dfs(id[now]) + 1);
		}
	}
	return dp[cur] = res;
}


int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/
	scanf("%lld", &N);
	a.resize(N);
	dp = vector<ll>(N, -1);
	for (ll i = 0; i < 1000050; i++) id[i] = -1;

	for (ll i = 0; i < N; i++) {
		scanf("%lld", &a[i]);
	}
	sort(a.begin(), a.end());
	for (ll i = 0; i < N; i++) id[a[i]] = i;
	ll res = 0;
	for (ll i = 0; i < N; i++) {
		chmax(res, dfs(i));
	}
	cout << res << endl;
	return 0;
}