CodeForces 757B 数学+模拟

http://codeforces.com/problemset/problem/757/B

Bash has set out on a journey to become the greatest Pokemon master. To get his first Pokemon, he went to Professor Zulu's Lab. Since Bash is Professor Zulu's favourite student, Zulu allows him to take as many Pokemon from his lab as he pleases.

But Zulu warns him that a group of k > 1 Pokemon with strengths {s1, s2, s3, ..., sk} tend to fight among each other if gcd(s1, s2, s3, ..., sk) = 1 (see notes for gcd definition).

Bash, being smart, does not want his Pokemon to fight among each other. However, he also wants to maximize the number of Pokemon he takes from the lab. Can you help Bash find out the maximum number of Pokemon he can take?

Note: A Pokemon cannot fight with itself.

Input

The input consists of two lines.

The first line contains an integer n (1 ≤ n ≤ 105), the number of Pokemon in the lab.

The next line contains n space separated integers, where the i-th of them denotes si (1 ≤ si ≤ 105), the strength of the i-th Pokemon.

Output

Print single integer — the maximum number of Pokemons Bash can take.

Examples

Input

3
2 3 4

Output

2

Input

5
2 3 4 6 7

Output

3

Note

gcd (greatest common divisor) of positive integers set {a1, a2, ..., an} is the maximum positive integer that divides all the integers {a1, a2, ..., an}.

In the first sample, we can take Pokemons with strengths {2, 4} since gcd(2, 4) = 2.

In the second sample, we can take Pokemons with strengths {2, 4, 6}, and there is no larger group with gcd ≠ 1.

题目大意：给你n个数，让你在里面选出m个最多的不互质的数。

思路：不互质，说明有公因数，那么这m个数必定是其中最小的那个数的倍数。开一个数组a，a[i]表示这n个数中是i的倍数的数的个数，遍历a[i]输出最大值即可。时间复杂度比n*√n要低。

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#define INF 0x3f3f3f3f
using namespace std;

int a[1000005];

int main()
{
	int n;
	scanf("%d",&n);
	int temp;
	int MAX=0;
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&temp);
		MAX=max(MAX,temp);
		a[temp]++;
		for(int i=2;i*i<=temp;i++)
		{
			if(temp%i==0)
			{
				if(i*i!=temp)
				{
					a[i]++;
					a[temp/i]++;
				}
				else
					a[i]++;
			}
		}
	}
	int MIN=1;
	for(int i=2;i<=MAX;i++)
		if(a[i]>MIN)
			MIN=a[i];
	printf("%d\n",MIN);
	return 0;
}