#include <iostream>
#include <algorithm>
#include <vector>
#define rep(i, j) for(int i = 0; i < j; i++)
#define For(i, a, j) for(int i = a; i < j; i++)
#define all(i) i.begin(), i.end()
using namespace std;
int clc(int num, int tar, int n, vector<int> dat)
{
	int ans = 0, tmp = 0;
	For(i, tar, n)
	{
		if (dat[i] % dat[tmp] == 0)
		{
			tmp = i; ans++;
		}
	}
	return ans + 1;
}
int main()
{
	int n; cin >> n;
	vector<int> dat(n);
	rep(i, n) { cin >> dat[i]; }
	sort(all(dat));
	int ans = 0;
	rep(i, n) For(j, i, n)
	{
		if (i == j) continue;
		ans = max(ans, clc(i, j, n, dat));
	}
	printf("%d\n", ans);
	return 0;
}