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

std::vector<int> enum_div(int n)//nの約数を列挙
{
	std::vector<int> ret;
	for(int i=1 ; i*i<=n ; ++i)
	{
		if(n%i == 0)
		{
			ret.push_back(i);
			if(i!=1 && i*i!=n)
			{
				ret.push_back(n/i);
			}
		}
	}
	return ret;
}

int main()
{
	int N; std::cin >> N;
	int *x = new int[N];
	bool *X = new bool[2000000];
	for(int i=0;i<2000000;i++)
	{
		X[i] = false;
	}
	for(int i=0;i<N;i++)
	{
		std::cin >> x[i];
		X[x[i]] = true;
	}
	std::sort(x , x+N);
	int *dp = new int[x[N-1]];
	dp[x[0]] = 1;
	int M = 1;
	
	for(int i=1;i<N;i++)
	{
		int max = 1;
		int l=1;
		std::vector<int> div = enum_div(x[i]);
		for(auto k : div)
		{
			if(X[k])
			{
				l = dp[k] + 1;
				if(l > max) max = l;
			}
		}
		dp[x[i]] = max;

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

	delete[] x;
	delete[] dp;
	delete[] X;
	return 0;
}