#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main(){
    int N; cin >> N;
    vector<int> x(N);
    int max_x = 0;
    for(int i=0;i<N;i++){
        cin >> x[i];
        max_x = max(max_x, x[i]);
    }

    sort(x.begin(), x.end());
    vector<int> dp(max_x+1, -1);

    for(int i=0;i<N;i++) dp[x[i]] = 1;
    int ans = 0;
    for(int i=0;i<N;i++){
        for(int j=2*x[i]; j<=max_x; j+=x[i]){
            if(dp[j] == -1) continue;
            dp[j] = max(dp[j], dp[x[i]]+1);
        }
        ans = max(ans, dp[x[i]]);
    }
    cout << ans << endl;
    return 0;

}