int max = 0;

for (map<int, int>::iterator i = list.begin(); i != list.end(); ++i) {

if ((*i).second > max)

max = (*i).second;

}

return max;

int n, elem;

cin >> n;

int p = n;

map<int, int> list;

while (n--) {

cin >> elem;

list[elem]++;

}

cout << p - findMaxOccurence(list);

return 0;