#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <complex>
using namespace std;

#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)

typedef long long ll;
typedef uint64_t ull;
typedef pair<int, int> P;
typedef pair<int, double> Pid;
typedef pair<double, int> Pdi;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<int, pair<int, int>> PP;
typedef pair<P, int> PPi;
constexpr double PI = 3.1415926535897932;   // acos(-1)
constexpr double EPS = 1e-9;
constexpr int INF = 1001001001;
constexpr int mod = 1e+9 + 7;
// constexpr int mod = 998244353;

vector<int> divisor(int x){
    vector<int> res;
    for(int i = 1; (ll)i * i <= x; ++i){
        if(x % i == 0){
            res.push_back(i);
            if(i * i != x)  res.push_back(x / i);
        }
    }
    sort(res.begin(), res.end());
    return res;
}

vector<vector<int>> pos(300005);
vector<int> dp;

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

    int n;
    cin >> n;
    vector<int> a(n);
    for(int i = 0; i < n; ++i){
        cin >> a[i];
        pos[a[i]].push_back(i);
    }
    dp.assign(n, 1);
    for(int i = n - 1; i > 0; --i){
        vector<int> div = divisor(a[i]);
        int sz = div.size();
        for(int j = 0; j < sz - 1; ++j){
            auto it = lower_bound(pos[div[j]].begin(), pos[div[j]].end(), i);
            if(it == pos[div[j]].begin())   continue;
            int p = it - pos[div[j]].begin() - 1;
            chmax(dp[pos[div[j]][p]], dp[i] + 1);
        }
    }
    cout << *max_element(dp.begin(), dp.end()) << endl;
}