/*
TASK:melody
LANG:C++
*/
#include<iostream>
#include<algorithm>
using namespace std;
long max1=0,max2=0,m=0;

int main()
{
    int n,a[1000],i,br1=0,br2=0,p=0;
    
    cin>>n;
    for(i=0;i<n;i++)
    { cin>>a[i];}
    sort(a,a+n);
    i=n-1;
    while(a[i]!=a[i-1])
    {
                       i--;
                    }
    while(a[i]==a[i-1])
    {max1+=a[i];br1++;
    i--;}
    max1+=a[i];
    br1++;
    while(a[i]!=a[i-1])
    {
                       i--;
                    }
    while(a[i]==a[i-1])
    {max2+=a[i];br2++;
    i--;}
    max2+=a[i];
    br2++;
    while(i>0)
    {
              if(a[i]==a[i-1]) {
                               while(a[i]==a[i-1]){
                                                   m+=a[i];
                                                    i--;
                                                    p++;                  
                                                    }  
                               m+=a[i];
                               p++;
                               if(m<max1&&m>max2){ max2=m;br2=p;}
                               else if(max1<m&&max1>max2){max2=max1;br2=br1;max1=m;br1=p;}
                               
                               p=0;
                               m=0;
                               }
              i--;
    }
    cout<<n-(br1+br2)<<"\n";                
    
    return 0;
}
     
