#include <iostream>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <sstream>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <complex>
#include <vector>
#include <bitset>
#include <cstdio>
#include <cmath>
#include <time.h>
#include <tuple>
#define all(c) ((c).begin(),(c).end())
#define rall(c) ((c).rbegin(),(c).rend())
#define ll long long
#define fi first
#define se second
#define inf (999999999)
using namespace std;
const ll MOD = 1e9 + 7;
const double PI = acos(-1.0);
//---------------------------------------------------------------------------------------------//
int n;
int a[100001];
int dp[1000001];

inline int solve() {
	for (int i = 0; i < n; i++) {
		dp[i] = -inf;
	}
	for (int i = 0; i < n; i++)dp[a[i]] = 1;
	for (int i = 1; i < 1000001; i++) {
		if (dp[i] >0) {
			int now = i * 2;
			while (now<=1000001) {
				if (dp[now]>=1) {
					dp[now] = max(dp[now], dp[i] + 1);
				}
				now += i;
			}
		}
	}
	int res = -inf;
	for (int i = 0; i < n; i++) {
		res = max(res, dp[a[i]]);
	}
	return res;
}
int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	sort(a, a + n);
	cout << solve() << endl;
	return 0;
}