#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <fstream>
using namespace std;

#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
typedef long long ll;

#define INF 1000000000


int main(){
    int n;
    cin>>n;
    vector<int> x(n);
    rep(i,n) scanf("%d", &x[i]);

    sort(x.begin(), x.begin()+n);

    int dp[100000];
    fill(dp, dp+100000, 1);

    rep(i,n){
        rep(j,i){
            if(x[i]%x[j]==0) dp[i] = max(dp[i], dp[j]+1);
        }
    }

    int res=0;
    rep(i,n) res = max(res, dp[i]);

    cout<<res<<endl;

    return 0;
}