#include<iostream>
#include<algorithm>
using namespace std;

int main()
{
	int n, x[100000], dp[100000], a, i, j = 2, k, count = 1, max = 0;

	cin >> n;

	for (i = 1; i <= n; i++)
	{
		cin >> x[i];
		dp[i] = 0;
	}

	sort(x, x + n + 1);

	if (x[1] == 1) a = 2;
	else a = 1;

	for (i = a; i <= n; i++)
	{
		if (dp[i] == 1) continue;

		while (x[i] * j<= x[n])
		{
			for (k = i + 1; k <= n; k++)
			{
				if (x[i] * j == x[k])
				{
					dp[k] = 1;
					count++;
					j = 2;
					x[i] = x[k];
					break;
				}
				if (n == k && x[i] != x[k]) j++;
			}
		}

		if (count > max)
		{
			max = count;
		}

		count = 0;
		j = 2;
	}

	cout << max + a - 1 << endl;
}