Codeforces 757B Bash's Big Day math, number theory

B. Bash's Big Day

time limit per test

2 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

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.

用每一个素数暴力解题：

#include <iostream> 
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <list>
#define rep(i,m,n) for(i=m;i<=n;i++)
#define rsp(it,s) for(set<int>::iterator it=s.begin();it!=s.end();it++)
const int inf_int = 2e9;
const long long inf_ll = 2e18;
#define inf_add 0x3f3f3f3f
#define mod 1000000007
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pi acos(-1.0)
#define pii pair<int,int>
#define Lson L, mid, rt<<1
#define Rson mid+1, R, rt<<1|1
const int maxn=5e2+10;
using namespace std;
typedef  long long ll;
typedef  unsigned long long  ull; 
inline int read(){int ra,fh;char rx;rx=getchar(),ra=0,fh=1;
while((rx<'0'||rx>'9')&&rx!='-')rx=getchar();if(rx=='-')
fh=-1,rx=getchar();while(rx>='0'&&rx<='9')ra*=10,ra+=rx-48,
rx=getchar();return ra*fh;}
//#pragma comment(linker, "/STACK:102400000,102400000")
ll gcd(ll p,ll q){return q==0?p:gcd(q,p%q);}
ll qpow(ll p,ll q){ll f=1;while(q){if(q&1)f=f*p;p=p*p;q>>=1;}return f;}


const int N = 1e5+5;

int n ;
vector<int> a; 	
int sum[1000005];
int rs[100005];
//vector<int> pri;
int isprime[1000010];
int prime[1000010];
int cnt  = 0;
void initprime()
{
	for(int i=2;i<N;i++)
	{
		isprime[i] = true;
	}
	for(int i=2;i<N;i++)
	{
		if(isprime[i])
		{
			prime[cnt++]=i;
			for(int j=i<<1;j<N;j+=i)
			{
				isprime[j] = false; 
			}
 		}	
	} 
}

int main()
{
	ios::sync_with_stdio(false);
	int re = 1;
	int maxx = -1;
	int ct = 0;
	initprime();
	cin >> n;
	for(int i=0;i<n;i++)
	{
		int t;
		cin>>t;
		if(maxx<t)
			maxx=t;
		if(t!=1)
		{
			if(sum[t]==0)
				a.push_back(t);
			sum[t]++;
		}
	}
	for(int i=0;i<a.size();i++)
	{
		for(int j=0;j<cnt;j++)
		{
			int tt = prime[j];
			if(tt>a[i])
				break;
			if(a[i]%tt==0)
			{
				rs[j]+=sum[a[i]];
			} 
		}
	
	}
	for(int i=0;i<cnt;i++)
	{
		if(re<rs[i])
			re = rs[i];
	}
	cout <<re<<endl;
}