#include <bits/stdc++.h>
using namespace std;
int f_op=-100;
int minOp(int arr[],int n){
unordered_map<int,int>m;
for(int i=0;i<n;i++){
m[arr[i]]++;
}
for(int i=0;i<n;i++){
f_op=max(f_op,m[i]);
}
return n-f_op;
}
int main() {
// your code goes here
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++){
cin>>arr[i];
}
cout<<"The minimum operation is:"<<minOp(arr,n);
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBmX29wPS0xMDA7CmludCBtaW5PcChpbnQgYXJyW10saW50IG4pewoJdW5vcmRlcmVkX21hcDxpbnQsaW50Pm07Cglmb3IoaW50IGk9MDtpPG47aSsrKXsKCQltW2FycltpXV0rKzsKCX0KCWZvcihpbnQgaT0wO2k8bjtpKyspewoJCWZfb3A9bWF4KGZfb3AsbVtpXSk7Cgl9CglyZXR1cm4gbi1mX29wOwp9CmludCBtYWluKCkgewoJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJaW50IG47CgljaW4+Pm47CglpbnQgYXJyW25dOwoJZm9yKGludCBpPTA7aTxuO2krKyl7CgkJY2luPj5hcnJbaV07Cgl9Cgljb3V0PDwiVGhlIG1pbmltdW0gb3BlcmF0aW9uIGlzOiI8PG1pbk9wKGFycixuKTsKCXJldHVybiAwOwp9