#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

const int MAX=300010;
int d[MAX];
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin>>n;
    vector<int> a(n);
    for ( int i=0; i<n; i++ ) cin>>a[i];
    for ( int i=0; i<n; i++ ) {
        int res=1;
        for ( int j=1; j*j<=a[i]; j++ ) {
            if ( j<a[i] && a[i]%j==0 ) {
                res=max(res,d[j]+1);
                if ( a[i]/j<a[i] && a[i]/j!=j ) res=max(res,d[a[i]/j]+1);
            }
        }
        d[a[i]]=max(d[a[i]],res);
    }
    int ans=0;
    for ( int i=1; i<MAX; i++ ) ans=max(ans,d[i]);
    cout<<ans<<'\n';
    return 0;
}