#ifdef LOCAL111
	#define _GLIBCXX_DEBUG
#else
	#pragma GCC optimize ("O3")
	#define NDEBUG
#endif
// #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template<typename T, typename U> ostream& operator<< (ostream& os, const pair<T,U>& p) { os << '(' << p.first << ' ' << p.second << ')'; return os; }

#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--)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
	template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
#else
	#define DEBUG(x) true
	template<typename T> void dpite(T a, T b){ return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
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;}

template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value!=0>::type
fill_v(U &u,const V... v){u=U(v...);}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value==0>::type
fill_v(U &u,const V... v){
  for(auto &e:u) fill_v<T>(e,v...);
}

const array<int, 4> dx = {0, 1, 0, -1};
const array<int, 4> dy = {1, 0, -1, 0};


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

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;
	while(cin >> n) {
		vector<int> a(n);
		REP(i, n) cin >> a[i];
		int ma = 0;
		REP(i, n) chmax(ma, a[i]);
		vector<vector<int>> ids(ma + 1);
		REP(i, n) {
			ids[a[i]].push_back(i);
		}
		vector<int> dp(ma + 1, -1);

		REP(i, ma + 1) {
			if(SZ(ids[i]) > 0) {
				dp[i] = ids[i].back();
			}
		}


		int ans = 1;
		REP(k, 25) {
			DEBUG(k);
			vector<int> nex(ma + 1, -1);
			FOR(d, 1, ma + 1) {
				DEBUG(d);
				int p = d + d;
				int v = -1;
				while(p < ma + 1) {
					DEBUG(p);
					chmax(v, dp[p]);
					p += d;
				}
				DEBUG(v);
				dpite(ALL(ids[d]));
				RREP(i, SZ(ids[d])) {
					if(ids[d][i] < v) {
						nex[d] = ids[d][i];
						break;
					}
				}
			}
			dpite(ALL(dp));
			dpite(ALL(nex));

			bool f = false;
			REP(i, SZ(nex)) {
				if(nex[i] != -1) {
					f = true;
				}
			}
			if(!f) {
				break;
			}
			ans = k + 2;
			swap(nex, dp);

		}
		cout << ans << endl;
	}

	return 0;
}