#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
    int N,input,max,ans = 1;
    vector<int> x;
    int dp[100000]={};
    cin >> N;
    for(int i=0;i<N;i++){
        cin >> input;
        x.push_back(input);
    }
    sort(x.begin(),x.end());
    for(int i=0;i<N;i++){
        max = 1;
        for(int j=0;j<i;j++){
            if(x[i]%x[j] == 0 && max < dp[j]+1) max = dp[j]+1;
        }
        dp[i] = max;
        if(ans < max) ans = max;
    }
    cout << ans << endl;
    return 0;
}