#include <iostream>
#include <climits>
using namespace std;

int main() {
    int n;
    cin >> n;

    int arr[n];

    for (int i = 0; i < n; i++) {
        cin >> arr[i];
    }

    int steps = 0;

    while (true) {
        int largest = INT_MIN;
        int secondLargest = INT_MIN;
        int index = -1;

        // Find largest element and its index
        for (int i = 0; i < n; i++) {
            if (arr[i] > largest) {
                largest = arr[i];
                index = i;
            }
        }

        // Find second largest distinct element
        for (int i = 0; i < n; i++) {
            if (arr[i] < largest && arr[i] > secondLargest) {
                secondLargest = arr[i];
            }
        }

        // All elements are equal
        if (secondLargest == INT_MIN) {
            break;
        }

        // Replace largest with second largest
        arr[index] = secondLargest;

        steps++;
    }

    cout << "Number of steps = " << steps << endl;

    return 0;
}