#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

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

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int dp[1123456];
int n;
int x[112345];

int main() {
	cin >> n;
	REP(i, n) scanf("%d", x + i);
	sort(x, x + n);
	
	REP(i, n) {
		for (int j = 2; j <= 1000000; j++) {
			if ((ll)x[i] * j > 1000000) break;
			chmax(dp[x[i] * j], dp[x[i]] + 1);
		}
	}
	
	int ans = 0;
	REP(i, 1000001) chmax(ans, dp[i]);
	cout << ans << endl;
	
	return 0;
}