#ifdef LOCAL111
#else
	#define NDEBUG
#endif
#include <bits/stdc++.h>
const int INF = 1e8;
using namespace std;

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define RBP(i,a) for(auto& i : a)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
#else
	#define DEBUG(x) true
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
#define rangej(a,b,c) ((a) <= (c) and (c) < (b))
#define rrangej(b,c) rangej(0,b,c)
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}

typedef pair<int,int> P;
typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<LL,LL> LP;

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);	
}

int main()
{
	ios_init();
	int n;
	cin >> n;
	set<int> s;
	vector<int> x;
	int ma = 0;
	REP(i,n){
		int in;
		cin >> in;
		s.insert(in);
		ma = max(in,ma);
	}
	RBP(e,s) x.push_back(e);
	unordered_map<int,int> mp;
	REP(i,SZ(x)){
		mp[x[i]] = i;
	}
	n = SZ(x);
	vector<int> dp(n,1);
	dp[n-1] = 1;
	RREP(i,n-1){
		for(int j = 2; x[i]*j <= ma; j++){
			if(mp.find(x[i]*j) != mp.end()){
				dp[i] = max(dp[i],dp[mp[x[i]*j]]+1);
			}
		}
	}
	//pite(ALL(x));
	//pite(ALL(dp));
	int ans = 0;
	RBP(e,dp) ans = max(ans,e);
	cout << ans << endl;
	return 0;
}