#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int minSteps(vector<int>&a){
    int n = a.size();
    sort(a.begin(), a.end());
    int steps = 0;
    for(int i = n-1 ; i>0 ; i--){
        if(a[i]>a[i-1]){
            steps += (n-i);
        }

    }
    return steps;
}
int main(){
    vector<int> a = {886,777};
    cout << minSteps(a) << endl;
    return 0;
}