#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

int N;
bool isIn[1000100];
int dp[1000100];

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

    std::cin >> N;

    for(int i=0;i<N;++i){
        int x;
        std::cin >> x;

        isIn[x] = true;
        dp[x] = 1;
    }

    int res = 0;
    for(int i=1;i<=1000000;++i){
        if(!isIn[i]){continue;}

        res = max(res, dp[i]);
        
        for(int j=2*i;j<=1000000;j+=i){
            if(isIn[j]){
                dp[j] = max(dp[j], dp[i] + 1);
            }
        }
    }

    std::cout << res << std::endl;
}