/*
TASK:melody
LANG:C++
*/
#include <iostream>
using namespace std;
int main()
{
int res,j,i,n,m[1024],a=0,b=0,x=0;
cin>>n;
for (i=1;i<=n;i++)
cin>>m[i];
for (i=1;i<=n;i++)
     for (j=i+1;j<=n;j++)
     if (m[i]>m[j]) swap(m[i],m[j]);
for (i=1;i<=n-1;i++)
     {
     for (j=i+1;j<=n;j++) if (m[i]!=m[j]) {x=j-i;break;}
     if (x>a) {swap(a,b);a=x;} else if (x>b) b=x;
     x=0;
     }
res=n-a-b;
cout<<res<<endl;
//cout<<a<<' '<<b<<endl;
return 0;
}
