#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)
#define MAX LONG_LONG_MAX

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

int N;
int DP[1100000];

signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin >> N;
    
    int X[N];
    REP(i, N) cin >> X[i];
    sort(X, X+N);
    
    REP(i, 1100000) DP[i] = 0;
    REP(i, N) DP[X[i]] = 1;
    
    int ans = 0;
    REP(i, N) {
        int x = X[i];
        FOR(j, 1, sqrt(x)+1) {
            if (x % j != 0) continue;
            int k = x / j;
            if (j != x) DP[x] = max(DP[x], DP[j] + 1);
            if (k != x && j != k) DP[x] = max(DP[x], DP[k] + 1);
            ans = max(ans, DP[x]);
        }
    }
    
    cout << ans << endl;
    
    
    return 0;
}