#include <bits/stdc++.h>
using namespace std;
 
int main() {
	// your code goes here
 
	int n;
	cin>>n;
	vector<int>arr(n+1,0);
	for(int i=1;i<=n;i++){
		cin>>arr[i];
	}
	//  store freq of each pile in hashmap
	map<int, int> mp;
	for(int i=1;i<=n;i++){
		mp[arr[i]]++;
 
	}
 
	vector<pair<int, int>>p;
	for(auto u : mp){
	 p.push_back({u.first, u.second});
	}
	int step=0;
	int size= p.size();
 
	for(int i= size-1;i>=1;--i){
		p[i-1].second= p[i-1].second+p[i].second;
		step= step+p[i].second;
		p[i].second=0;
	}
	cout<<step<<endl;
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCQoJaW50IG47CgljaW4+Pm47Cgl2ZWN0b3I8aW50PmFycihuKzEsMCk7Cglmb3IoaW50IGk9MTtpPD1uO2krKyl7CgkJY2luPj5hcnJbaV07Cgl9CgkvLyAgc3RvcmUgZnJlcSBvZiBlYWNoIHBpbGUgaW4gaGFzaG1hcAoJbWFwPGludCwgaW50PiBtcDsKCWZvcihpbnQgaT0xO2k8PW47aSsrKXsKCQltcFthcnJbaV1dKys7CgkJCgl9CgkKCXZlY3RvcjxwYWlyPGludCwgaW50Pj5wOwoJZm9yKGF1dG8gdSA6IG1wKXsKCSBwLnB1c2hfYmFjayh7dS5maXJzdCwgdS5zZWNvbmR9KTsKCX0KCWludCBzdGVwPTA7CglpbnQgc2l6ZT0gcC5zaXplKCk7CgkKCWZvcihpbnQgaT0gc2l6ZS0xO2k+PTE7LS1pKXsKCQlwW2ktMV0uc2Vjb25kPSBwW2ktMV0uc2Vjb25kK3BbaV0uc2Vjb25kOwoJCXN0ZXA9IHN0ZXArcFtpXS5zZWNvbmQ7CgkJcFtpXS5zZWNvbmQ9MDsKCX0KCWNvdXQ8PHN0ZXA8PGVuZGw7CglyZXR1cm4gMDsKfQ==

NQo1IDIgMyAxIDI=

5
5 2 3 1 2