#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;

struct Graph {
    struct Vertex { int k, d; };
    struct Edge { int i; };
    Graph(int n) : v(n, { 0, 0 }), e(n), n(n) {}
    void add_edge(int i, int j) {
        e[i].push_back({ j });
        v[j].k++;
    }
    void tsort() {
        vector<int> q(n);
        int i0 = 0, i1 = 0;
        for (int i = 0; i < n; i++) {
            if (v[i].k == 0) q[i1++] = i, v[i].d = 0;
        }
        int r = 0;
        while (i0 < i1) {
            int i = q[i0++];
            for (auto &o : e[i]) {
                if (--v[o.i].k == 0) q[i1++] = o.i, r = max(r, v[o.i].d = v[i].d + 1);
            }
        }
        cout << r + 1 << endl;
    }
    vector<Vertex> v;
    vector<vector<Edge>> e;
    int n;
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;

    vector<int> a(n), b((int)3e+5 + 1, -1);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    Graph g(n);
    for (int i = 0; i < n; i++) {
        int t = a[i];
        if (t > 1) {
            if (b[1] >= 0) g.add_edge(b[1], i);
            for (int k = 2; k * k <= t; k++) {
                if (t % k == 0) {
                    int l = t / k;
                    if (b[k] >= 0) g.add_edge(b[k], i);
                    if (k == l) break;
                    if (b[l] >= 0) g.add_edge(b[l], i);
                }
            }
        }
        b[t] = i;
    }

    g.tsort();

    return 0;
}