#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <bitset>
#include <cmath>
#include <bitset>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <stack>
#include <queue>
#include <functional>
#include <time.h>
#include <cstring>
#include <complex>
#include <stdio.h>
#include <iomanip>
#include <fstream>
#include <list>
#include <numeric>
#include <random>
#include <memory>
using namespace std;
#define MAXN 3e5 + 10
#define MAXNUM 1.5e7 + 10
int main()
{
int n;
(cin >> n);
{
vector<int> a(n);
vector<int> hash(MAXNUM);
int g;
for (int i = 0; i < n; ++i)
{
cin >> a[i];
if (i == 1) g = gcd(a[0], a[1]);
else if (i > 1) g = gcd(g, a[i]);
}
for (int i = 0; i < n; ++i) a[i] /= g;
int res = 0;
for (int i = 0; i < n; ++i)
{
int k = 2;
int tmp = a[i];
// 从2开始进行因式分解
while (k * k <= tmp && k * n <= MAXNUM)
{
if (tmp % k == 0)
{
hash[k]++;
res = max(hash[k], res);
while (tmp % k == 0)
{
tmp /= k;
}
}
k++;
}
if (tmp > 1)
{
hash[tmp]++;
res = max(hash[tmp], res);
}
}
cout << ((res == 0) ? -1 : (n - res)) << endl;
}
return 0;
}