#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define ll long long
using namespace std;
//typedef vector<unsigned int>vec;
//typedef vector<ll>vec;
//typedef vector<vec> mat;

const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000;//1e18
const ll  MOD = 1000000007;
const double PI = acos(-1.0);
const double EPS = 1e-10;

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; }
//template<class T> inline void add(T &a, T b){a = ((a+b) % MOD + MOD) % MOD;};


int dp[1010101];
int N;
int pre[1010101];

vector<ll> enumdiv(ll n){
    vector<ll> S;
    for(ll i=1;i*i<=n;i++) if(n%i == 0){
        S.push_back(i);
        if(i*i != n) S.push_back(n/i);
    }
    sort(S.begin(), S.end());
    return S;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> N;
    vector<int> x(N);
    REP(i,N) cin >> x[i];
    //sort(x.begin(), x.end());
    REP(i,N) dp[x[i]] = 1;

    for(int i=1;i<1000001;i++) if(dp[i]){
        auto v = enumdiv(i);
        for(auto j : v) if(j != i){
            chmax(dp[i], dp[j] + 1);
            pre[i] = j;
        }
    }
    int ans = 0;
    int cur = -1;
    int idx = -1;
    REP(i,N) if(chmax(ans, dp[x[i]])) cur = x[i], idx = i;
    ans = 0;
    for(int i=idx;i>=0;i--){
        if(cur == x[i]){
            ans++;
            cur = pre[x[i]];
        }
    }
    cout << ans << endl;
}