#include <cmath>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <functional>
#include <queue>
#include <iostream>
#include <string.h>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <cstdint>
#include <climits>
#include <unordered_set>
#include <sstream>
#include <stack>

using namespace std;

typedef long long int ll;
typedef tuple<int,int,int> t3;


using namespace std;

#define MAX_N ((int)(1e6+1))

int dp[MAX_N];

vector<int> enumerate(int n)
{
    vector<int> v;
    for(int i = n * 2;i < MAX_N;i += n)
    {
        v.push_back(i);
    }
    return v;
}

void solve()
{
    int n;
    cin >> n;
    for(int i = 0;i < n;i++)
    {
        int a;
        cin >> a;
        dp[a] = 1;
    }
    int m = 1;
    for(int i = 1;i < 1e6+1;i++)
    {
        if(dp[i] <= 0) continue;
        auto v = enumerate(i);
        for(auto e : v)
        {
            if(dp[e] > 0)
            {
                dp[e] = max(dp[e], dp[i]+1);
            }
        }
        m = max(m, dp[i]);
    }
    cout << m << endl;
}

int main()
{
    solve();
    return 0;
}