#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n+1); i++)
#define repn(i,a,b) for (int i = (int)(a) ; i < (int)(b+1); i++)
#define repv(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define sz(x) ((int)(x).size())
#define uni(v) v.erase(unique(v.begin(), v.end()), v.end());
using ll = long long;
using P = pair<int,int>;
using mint = modint998244353;
ostream& operator<< (ostream& os, const mint &x) {os << x.val(); return os;}
#ifdef LOCAL
    #include <debug.hpp>
    #define debug(...) debug::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
    #define debug(...) (static_cast<void>(0))
#endif

template <typename T> struct LIS{
  public:
    LIS(vector<T> lis){
		_index.resize(lis.size());
        for(int x = 0; x < (int)lis.size(); x++){
			auto itr = lower_bound(_dp.begin(), _dp.end(), lis.at(x));
			if(itr != _dp.end()){
				*itr = lis.at(x);
                _index.at(x) = itr - _dp.begin() + 1;
			} else{
				_dp.push_back(lis.at(x));
                _index.at(x) = _dp.size();
			}
		}
        _lis = _dp.size();
    }
    inline int get_lis(){ return _lis;}
    vector<int> get_lis_idx(){
        int target = *max_element(_index.begin(), _index.end());
        vector<int> res(target, -1);
        for(int i = _index.size()-1; i >= 0; i--){
            if(_index.at(i) == target){
                res.at(target-1) = i;
                target--;
            }
        }
        return res;
    }
  private:
    int _lis;
    vector<int> _dp, _index;
};

vector<ll> divisor(ll n){
    vector<ll> res;
    for(ll i = 1; i * i <= n; i++){
        if(n % i == 0){
            res.push_back(i);
            if(i * i != n) res.push_back(n / i);
        }
    }
    return res;
}

int main(){
    int n;
    cin >> n;
    vector<int> a(n);
    rep(i,n) cin >> a[i];
    int c = *max_element(a.begin(), a.end());
    vector<int> dp(c,0);
    rep(i,n){
        vector<ll> div = divisor(a[i]);
        int max_num = 0;
        for(auto d: div){
            d--;
            max_num = max(max_num, dp[d]);
        }
        debug(div);
        debug(max_num);
        dp[a[i]-1] = max_num + 1;
    }
    debug(dp);
    cout << *max_element(dp.begin(), dp.end()) << endl;
    return 0;
}