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 xe2 x80 x89> xe2 x80 x891 Pokemon with strengths {s1, xe2 x80 x89s2, xe2 x80 x89s3, xe2 x80 x89..., xe2 x80 x89sk} tend to fight among each other if gcd(s1, xe2 x80 x89s2, xe2 x80 x89s3, xe2 x80 x89..., xe2 x80 x89sk) xe2 x80 x89= xe2 x80 x891 (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. The input consists of two lines. The first line contains an integer n (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105), the number of Pokemon in the lab. The next line contains n space separated integers, where the i-th of them denotes si (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89si xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105), the strength of the i-th Pokemon. Print single integer -- the maximum number of Pokemons Bash can take. gcd (greatest common divisor) of positive integers set {a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an} is the maximum positive integer that divides all the integers {a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an}. In the first sample, we can take Pokemons with strengths {2, xe2 x80 x894} since gcd(2, xe2 x80 x894) xe2 x80 x89= xe2 x80 x892. In the second sample, we can take Pokemons with strengths {2, xe2 x80 x894, xe2 x80 x896}, and there is no larger group with gcd xe2 x80 x89 xe2 x89 xa0 xe2 x80 x891. "...