#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>
#include<random>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, -1, 0, 1};
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

const int MAXN = 1001000;
bool exist[MAXN];
int dp[MAXN];

vi divs(int n) {
    vi ret;
    for (int i = 1; i*i <= n; i++) {
        if (n%i == 0) {
            ret.push_back(i);
            if (i*i < n) ret.push_back(n/i);
        }
    }
    return ret;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    for (int i = 0; i < N; i++) {
        int x;
        cin >> x;
        exist[x] = true;
    } 
    int ans = 1;
    for (int x = 1; x < MAXN; x++) {
        if (!exist[x]) continue;
        int& ret = dp[x];
        ret = 1;
        auto div = divs(x);
        for (int el : div) {
            if (el == x) continue;
            if (!exist[el]) continue;
            ret = max(ret, dp[el] + 1);
        }
        ans = max(ret, ans);
    }
    cout << ans << endl;
    return 0;
}