#include using namespace std; using ll = long long; using PII = pair; #define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i) #define REP(i, n) FOR(i, 0, n) #define ALL(x) x.begin(), x.end() template void chmin(T &a, const T &b) { a = min(a, b); } template void chmax(T &a, const T &b) { a = max(a, b); } struct FastIO {FastIO() { cin.tie(0); ios::sync_with_stdio(0); }}fastiofastio; #ifdef DEBUG_ #include "../program_contest_library/memo/dump.hpp" #else #define dump(...) #endif const ll INF = 1LL<<60; int main(void) { ll n; cin >> n; vector a(n); REP(i, n) cin >> a[i]; const ll m = 300000; vector dp(m+1); REP(i, n) { vector divs; for(ll j=1; j*j<=a[i]; j++) { if(a[i]%j == 0) { divs.push_back(j); if(a[i]/j != j && j!=1) divs.push_back(a[i]/j); } } for(auto j: divs) chmax(dp[a[i]], dp[j]+1); } ll ret = 1; REP(i, m+1) chmax(ret, dp[i]); cout << ret << endl; return 0; }