#include <iostream>
#include<bits/stdc++.h>
using namespace std;
bool check(vector<int> &arr,int mid){
int n = arr.size();
int i = n-mid;
int j=0;
while(i<n){
if(arr[j]>=arr[i]){
return false;
}
i++;
j++;
}
return true;
}
int main() {
// your code goes here
int n;
vector<int> arr(n);
for(int i=0;i<n;i++){
cin>>arr[i];
}
sort(arr.begin(),arr.end());
int low=0;
int high=n-1;
int ans=0;
while(low<=high){
cout<<"yes";
int mid = (low+high)/2;
if(check(arr,mid)==true){
ans = mid;
low=mid+1;
}
else{
high=mid-1;
}
}
cout<<ans<<endl;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTxiaXRzL3N0ZGMrKy5oPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCgpib29sIGNoZWNrKHZlY3RvcjxpbnQ+ICZhcnIsaW50IG1pZCl7CglpbnQgbiA9IGFyci5zaXplKCk7CglpbnQgaSA9IG4tbWlkOwoKCWludCBqPTA7CgkKCXdoaWxlKGk8bil7CgkJaWYoYXJyW2pdPj1hcnJbaV0pewoJCQlyZXR1cm4gZmFsc2U7CgkJfQoJCWkrKzsKCQlqKys7Cgl9CglyZXR1cm4gdHJ1ZTsKCQp9CmludCBtYWluKCkgewoJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJaW50IG47Cgl2ZWN0b3I8aW50PiBhcnIobik7Cglmb3IoaW50IGk9MDtpPG47aSsrKXsKCQljaW4+PmFycltpXTsKCX0KCQoJc29ydChhcnIuYmVnaW4oKSxhcnIuZW5kKCkpOwoJaW50IGxvdz0wOwoJaW50IGhpZ2g9bi0xOwoJaW50IGFucz0wOwoJCgl3aGlsZShsb3c8PWhpZ2gpewoJCWNvdXQ8PCJ5ZXMiOwoJCWludCBtaWQgPSAobG93K2hpZ2gpLzI7CgkJCgkJaWYoY2hlY2soYXJyLG1pZCk9PXRydWUpewoJCQlhbnMgPSBtaWQ7CgkJCWxvdz1taWQrMTsKCQkJCgkJfQoJCWVsc2V7CgkJCWhpZ2g9bWlkLTE7CgkJCQoJCX0KCX0KCWNvdXQ8PGFuczw8ZW5kbDsKCXJldHVybiAwOwp9