#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
 
using namespace std;
using ll = long long;
 
int main() {
    int n;
    cin >> n;
    
    vector<ll> a(n);
    rep(i, n) cin >> a[i];
    
    sort(a.begin(), a.end());
    
    vector<int> dp(n, 1);
    int maxSize = 1;
    for (int i = 1; i < n; ++i) {
        rep(j, i) {
            if (a[i]%a[j] == 0) {
                dp[i] = max(dp[i], dp[j]+1);
            }
        }
        
        if (dp[i] > maxSize) {
            maxSize = dp[i];
        }
    }
    
    cout << maxSize << '\n';
    
    return 0;
}