#include<bits/stdc++.h>
#include<atcoder/all>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<math.h>
#include<set>
#include<regex>
#include<deque>
#include<queue>
#define all(x) x.begin(),x.end()
#define gall(x) x.begin(),x.end(),greater<>()
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ll long long 
#define P pair<int,int>
#define LP pair<ll,ll>
using namespace std;
using namespace atcoder;


int main() {
    int n; cin>>n;
    vector<int> a(n+1);
    for(int i=1;i<=n;i++) cin>>a[i];
    vector<int> dp(n+1,1),r(1e5+5,-1);
    for(int i=1;i<=n;i++){
        for(int j=1;j*j<=a[i];j++){
            if(a[i]%j!=0) continue;
            if(r[j]!=-1) dp[i]=max(dp[i],dp[r[j]]+1);
            if(r[a[i]/j]!=-1) dp[i]=max(dp[i],dp[r[a[i]/j]]+1);
        }
        r[a[i]]=i;
    }
   cout<<*max_element(all(dp))<<endl;


	return 0;
}