#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <climits>
#include <tuple>

using namespace std;

int n;
int nums[100000];
int dp[100000];
int f(int index, int cnt) {
    if (dp[index]==0) {
        dp[index] = cnt;
        for (int i=index+1; i<n; ++i) {
            if (nums[i]%nums[index]==0) {
                dp[index] = max(dp[index], f(i, cnt+1));
            }
        }
    }

    return dp[index];
}

int main() {
    scanf("%d", &n);    
    getchar();

    for(int i=0; i<n; i++) {
        scanf("%d", &nums[i]);   
    }
    std::sort(nums, &nums[n], std::less<int>());

    int max_cnt=0;
    for(int i=0; i<n; i++) {
        max_cnt=max(max_cnt, f(i, 1));
    }

    printf("%d\n", max_cnt);
    
    return 0;
}