[codeforces]757B

time limit per test : 2 seconds
memory limit per test : 512 megabytes

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 ≤ 10^5)$, the number of Pokemon in the lab.
The next line contains n space separated integers, where the i-th of them denotes $s[i] (1 ≤ s[i] ≤ 10^5)$, the strength of the i-th Pokemon.
Output

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

Input1

3
2 3 4

Output1

2

Input2

5
2 3 4 6 7

Output2

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个不超过$10^5$的数，如果从中取出一组数，它们的最大公因数等于1，且这组数数量超过1个，则它们会打架，找到数字数量最多的一组数使得它们不会打架。

题解：
因为数字大小在100000以内，所以我们可以枚举最大公因数使用类似素数筛法的方法来统计最大公因数为x时可以取的数字个数。如果x>1时没有答案，那么就输出1就OK了。因为一个数总不会自己跟自己打架嘛。

#include<bits/stdc++.h>
#define LiangJiaJun main
using namespace std;
int x,n,t[100004];
int LiangJiaJun(){
    memset(t,0,sizeof(t));
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&x);
        t[x]++;
    }
    int ans=1;
    for(int i=2;i<=100000;i++){
        int cnt=0;
        for(int j=i;j<=100000;j+=i)cnt+=t[j];
        ans=max(ans,cnt);
    }
    printf("%d\n",ans);
    return 0;
}