#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <iomanip>
#include <array>
#include <numeric>
#include <regex>
#include <bitset>
#include <deque>

using namespace std;
typedef long long ll;
typedef pair<int, int> p_ii;

const int INF = 1e9;
const double PI = acos(-1.0);
const ll MOD = 1e9 + 7;

int n;
int x[100010];
int dp[1000010];

int main() {
    cin>>n;
    for (int i = 0; i < n; i++) {
        cin>>x[i];
    }
    int res=0;

    sort(x,x+n);
    int mx=x[n-1]+1;

    for (int i = 0; i < n; i++) {
        dp[x[i]]=1;
    }

    for (int i =0; i < n; i++) {
        for (int j = 2*x[i]; j <mx; j+=x[i]) {
            if(dp[j]==0)continue;
            dp[j]=max(dp[j],dp[x[i]]+1);
        }
        res=max(res,dp[x[i]]);
    }
    cout<<res<<endl;

    return 0;
}