#include <bits/stdc++.h>
#define MOD 1000000007

using namespace std;

int N;
vector<int> numset;
int dp[1000001] = {0};

int rec(int perv = 0, int count = 0){
    
    if(count == N) return count;
    if(dp[perv] != 0 && dp[perv] >= count) return dp[perv];
    
    int i, j;
    for(i = 0; i < N; ++i){
        if(perv == 0 || (numset[i] != perv && numset[i] % perv == 0)) dp[perv] = ((j = rec(numset[i], count + 1)) > dp[perv]) ? j : dp[perv];
    }
    
    return dp[perv] = (count > dp[perv]) ? count : dp[perv];
}


int main(void){
    
    cin >> N;
    
    int i, j;
    for(i = 0; i < N; ++i){
        cin >> j;
        numset.push_back(j);
    }
    
    sort(numset.begin(), numset.end());
    cout << rec() << endl;
    
    return 0;
}