/*
TASK:melody
LANG:C++
*/
#include <iostream>

using namespace std;

int br[127];

int main()
{
    int n;
    cin>>n;
    int a[n];
    for(int i=0;i<n;i++)
    cin>>a[i];
    
    for(int i=0;i<n;i++)
    {
            br[a[i]-1]++;
    }
    int max=0,max1=0,k,p;
    for(int i=0;i<127;i++)
    if(max<br[i]){max=br[i];k=i;}
    for(int i=0;i<127;i++)
    if(max1<br[i]&&k!=i){max1=br[i];}
    cout<<n-max-max1<<"\n";
    
            
            
    
    
    
    
    return 0;   
}
