// code of JUYU ^ ^ never doubt youself ! #include typedef long long ll; #define int ll #define For(i,a,b) for (int i = a; i <= b; i ++) #define Dow(i,a,b) for (int i = b; i >= a; -- i) #define ms(a,b) memset(a, b, sizeof (a)) #define fir first #define sec second #define mk make_pair #define pb push_back #define eb emplace_back using namespace std; typedef pair PII; const int mod = 998244353; const int MOD = 1000000007; const int maxn = 3e5 + 5; inline ll read() { ll t = 0, dp = 1; char c = getchar(); while(!isdigit(c)) {if (c == '-') dp = -1; c = getchar();} while(isdigit(c)) t = t * 10 + c - 48, c = getchar(); return t * dp; } inline void write(ll x){if (x < 0){putchar('-'); x = -x;} if(x >= 10) write(x / 10); putchar(x % 10 + 48);} inline void writeln(ll x){write(x); puts("");} inline void write_p(ll x){write(x); putchar(' ');} inline void write_b(ll x){putchar(' '); write(x);} inline int qpow(int x, int y, int z){int ret = 1; for (; y; y /= 2, x = x * x % z) if (y & 1) ret = ret * x % z; return ret;} inline int PrimeInv(int x, int y, int z){return qpow(x, y - 2, z);} int a[maxn], dp[maxn]; vector divide[maxn]; signed main() { int n = read(); For(i,1,n) a[i] = read(); For(i,1,n) For(j,1,n/i) divide[i * j].pb(i); For(i,1,n) { int MAX = 0; for (int x : divide[i]) if (x < i) MAX = max(MAX, dp[x]); dp[i] = ++ MAX; } int res = 0; For(i,1,n) res = max(res, dp[i]); writeln(res); return 0; } /* stuff you should look for * int overflow, array bounds * special cases (n=1?) * do smth instead of nothing and stay organized * WRITE STUFF DOWN * DON'T GET STUCK ON ONE APPROACH -- Benq */