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

int main()
{
    cin.sync_with_stdio(0);
    cin.tie(0);

    int n; cin>>n;
    vector<int> a(n), s(1000001);
    for(int& e: a) {
        cin>>e;
        s[e]++;
    }
    sort(begin(a), end(a));

    vector<int> dp(1000001);
    for(int e: a) {
        for(int i=1; i*i<=e; ++i) {
            int x=-1, y=-1;
            if (e%i==0) {
                if (s[i]) x=dp[i]+1;
                if (s[e/i] and i*i<e) y=dp[e/i]+1;
                dp[e]=max({dp[e], x, y});
            }
        }
    }
    cout<<*max_element(begin(dp), end(dp))<<endl;
}