#include <bits/stdc++.h>
using namespace std;
int main() {
int arr[]= {4, 5, 5, 2, 4};
int n=sizeof(arr)/sizeof(arr[0]);
int steps=0;
while(true)
{
int largest=INT_MIN;
int secLargest=INT_MIN;
bool flag=false;
for(int i=0;i<n;i++){
if(arr[i]>largest){
secLargest=largest;
largest=arr[i];
}
else if(arr[i]<largest && arr[i]>secLargest){
secLargest=arr[i];
}
}
if(secLargest == INT_MIN)
break;
for(int i=0;i<n;i++){
if(arr[i]==largest){
steps++;
arr[i]=secLargest;
flag=true;
}
}
if(flag==false)
break;
}
cout<<steps;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBhcnJbXT0gezQsIDUsIDUsIDIsIDR9OwoJaW50IG49c2l6ZW9mKGFycikvc2l6ZW9mKGFyclswXSk7CglpbnQgc3RlcHM9MDsKCXdoaWxlKHRydWUpCgl7CgkJaW50IGxhcmdlc3Q9SU5UX01JTjsKCQlpbnQgc2VjTGFyZ2VzdD1JTlRfTUlOOwoJCWJvb2wgZmxhZz1mYWxzZTsKCQlmb3IoaW50IGk9MDtpPG47aSsrKXsKCQkJaWYoYXJyW2ldPmxhcmdlc3QpewoJCQkJc2VjTGFyZ2VzdD1sYXJnZXN0OwoJCQkJbGFyZ2VzdD1hcnJbaV07CgkJCX0KCQkJZWxzZSBpZihhcnJbaV08bGFyZ2VzdCAmJiBhcnJbaV0+c2VjTGFyZ2VzdCl7CgkJCQlzZWNMYXJnZXN0PWFycltpXTsKCQkJfQoJCX0KCQlpZihzZWNMYXJnZXN0ID09IElOVF9NSU4pCgkJCWJyZWFrOwoJCWZvcihpbnQgaT0wO2k8bjtpKyspewoJCQlpZihhcnJbaV09PWxhcmdlc3QpewoJCQkJc3RlcHMrKzsKCQkJCWFycltpXT1zZWNMYXJnZXN0OwoJCQkJZmxhZz10cnVlOwoJCQl9CgkJfQoJCWlmKGZsYWc9PWZhbHNlKQoJCQlicmVhazsKCX0KCWNvdXQ8PHN0ZXBzOwoJcmV0dXJuIDA7Cn0K