#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<ll, ll>;
const long double PI = acos(-1.0L);
ll GCD(ll a, ll b) { return b?GCD(b, a%b):a; }
ll LCM(ll a, ll b) { return a/GCD(a, b)*b; }

int n;

int main() {
    cin >> n;
    vector<int> xvec(n, 0);
    for(int i = 0; i < n ; ++i) cin >> xvec[i];

    sort(xvec.begin(), xvec.end());
    vector<int> dp(1000100, 0);
    
    for(int i = 0; i < n; ++i) {
        int ch = xvec[i];
        int now = dp[ch]+1;
        while(ch <= 1000000) {
            chmax(dp[ch], now);
            ch += xvec[i];
        }
    }

    int ans = 0;
    for(int i = 0; i < n; ++i) chmax(ans, dp[xvec[i]]);
    cout << ans << endl;
}