/*
LANG:C++
TASK:melody
*/
#include<cstdio>
int a[256],n,m,max1,max2,f,i;
int main()
{
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
                    scanf("%d",&m);
                    a[m]++;
                    if(m>f)f=m;
    }
    for(i=0;i<f;i++)
    {
                  if(a[i]>max1){max2=max1;max1=a[i];}
                  else if(a[i]>max2)max2=a[i];
    }
    printf("%d\n",n-(max1+max2));
}










