← 返回题目

题库练习 Enlarge GCD

← 上一题下一题 →

A12008 | $Enlarge GCD$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

Mr. F has $n$ positive integers, $a_1, a_2, \ldots, a_n$ . He thinks the greatest common divisor of these integers is too small. So he wants to enlarge it by removing some of the integers. But this problem is too simple for him, so he does not want to do it by himself. If you help him, he will give you some scores in reward. Your task is to calculate the minimum number of integers you need to remove so that the greatest common divisor of the remaining integers is bigger than that of all integers.

输入格式

The first line contains an integer $n$ ( $2 \leq n \leq 3 \cdot 10^5$ ) — the number of integers Mr. F has. The second line contains $n$ integers, $a_1, a_2, \ldots, a_n$ ( $1 \leq a_i \leq 1.5 \cdot 10^7$ ).

输出格式

Print an integer — the minimum number of integers you need to remove so that the greatest common divisor of the remaining integers is bigger than that of all integers. You should not remove all of the integers. If there is no solution, print «-1» (without quotes).

输入输出样例

输入 #1

3
1 2 4

输出 #1

输入 #2

4
6 9 15 30

输出 #2

输入 #3

3
1 1 1

输出 #3

-1

C++ 编辑器

输入

输出