#include <bits/stdc++.h> 
using namespace std;
const int N = 1e5+10,M = 1e6+10;
int n,g,ans = INT_MAX;
int a[N],v[M];
int gcd(int x,int y){
    if(y == 0)return x;
    return gcd(y,x%y);
}
void fen(int x){
    for(int i = 1;i <= sqrt(x);i++)
        if(x % i == 0)v[i]++,v[x/i]++;
    int u = sqrt(x);
    if(u * u == x)v[u]--;
}
int main(){
    freopen("gcd.in","r",stdin);
    freopen("gcd.out","w",stdout);
    scanf("%d",&n);
    for(int i = 1;i <= n;i++){
        scanf("%d",&a[i]);
        if(i == 1)g = a[1];
        else g = gcd(g,a[i]);
        fen(a[i]);
    }
    for(int i = g+1;i <= 1e6;i++)
        ans = min(ans,n-v[i]);
    printf("%d\n",ans);
    
    return 0;
    
}