#include <iostream>
#include <vector>
#include <algorithm>

void run(std::vector<int>&xs, std::vector<int>&xs_dp,int index,int cost) {
	for (unsigned int i = index+1; i < xs.size(); i++) {
		if (xs[i] % xs[index] == 0&&xs_dp[i]<cost+1) {
			xs_dp[i] = cost+1;
			run(xs, xs_dp, i,cost+1);
		}
	}
}

int main() {
	int n;
	std::cin >> n;
	std::vector<int> xs(n);
	std::vector<int> xs_dp(n);
	for (int i = 0; i < n; i++) {
		std::cin >> xs[i];
		xs_dp[i] = 1;
	}
	std::sort(xs.begin(), xs.end());
	run(xs, xs_dp, 0, 1);
	std::cout << *std::max_element(xs_dp.begin(), xs_dp.end())<<std::endl;
}