#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(),(c).end()

#ifdef LOCAL
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else 
#define dump(x) true
#endif

constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

template<class T, class U> void chmin(T& t, const U& u) { if (t > u) t = u; }
template<class T, class U> void chmax(T& t, const U& u) { if (t < u) t = u; }

template<class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
	os<<"("<<p.first<<","<<p.second<<")";
	return os;
}

template<class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
	os<<"{";
	rep(i, v.size()) {
		if (i) os<<",";
		os<<v[i];
	}
	os<<"}";
	return os;
}

const int MX = 300010;

int dp[MX];

int main() {
	int N; cin >> N;
	V<int> A(N); rep(i, N) cin >> A[i];

	rep(i, N) {
		chmax(dp[A[i]], 1);
		for (int j = 1; j * j <= A[i]; ++j) {
			if (A[i] % j == 0) {
				if (j < A[i]) {
					chmax(dp[A[i]], dp[j] + 1);
				}
				if (j > 1) {
					chmax(dp[A[i]], dp[A[i] / j] + 1);
				}
			}
		}
	}
	cout << *max_element(dp, dp + MX) << endl;

	return 0;
}