#include <iostream>
#include <stdio.h>
#include <algorithm>

int main()
{
	int N; std::cin >> N;
	int *x = new int[N];
	int *dp = new int[N];
	for(int i=0;i<N;i++)
	{
		std::cin >> x[i];
	}
	std::sort(x , x+N);
	dp[0] = 1;

	int M = 0;
	for(int i=1;i<N;i++)
	{
		int max = 1;
		if(x[0]<=x[i]/2)
		{
		for(int j=0 ; j<i ; ++j)
		{
			int l=1;
			if(x[i]%x[j]==0) l = dp[j]+1;
			if(l > max) max = l;
		}
		}
		dp[i] = max;

		if(M < dp[i]) M = dp[i];
	}
	std::cout << M << std::endl;

	delete[] x;
	delete[] dp;

	return 0;
}