#include <bits/stdc++.h>
using namespace std;

#define REP(i,n) for(int i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<29
#define LINF LLONG_MAX/3
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(v) (v).begin(),(v).end()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
#define CININIT cin.tie(0),ios::sync_with_stdio(false)
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

#define MAX_X 1000000

int main(){
    int N;cin>>N;
    vi x(N);
    rep(i,N) cin>>x[i];
    sort(ALL(x));
    int maxl = *max_element(ALL(x));
    int dp[MAX_X + 10];
    for(int i=0;i<MAX_X+10;i++) dp[i]=0;

    rep(i,N) dp[x[i]] = 1;

    for(int i=0;i<N;i++){
        for(int j=2;x[i]*j<=maxl;j++){
            dp[x[i]*j] = max(dp[x[i]*j],dp[x[i]]+1);
        }
    }

    int ans = 0;
    for(int i=0;i<N;i++){
        ans = max(ans,dp[x[i]]);
    }
    cout << ans << endl;
}