import java.util.*;

public class Main {
    public static void main(String[] args) {
        int[] arr = {1, 2, 1, 4, 3, 1};
        int n = 6;

        Map<Integer, Integer> ump = new HashMap<Integer, Integer>();
        for (int i = 0; i < n; ++i) {
            if (ump.containsKey(arr[i])) {
                ump.put(arr[i], ump.get(arr[i]) + 1);
            } else {
                ump.put(arr[i], 1);
            }
        }

        int maxfreqsofar = 0;
        for (Map.Entry<Integer, Integer> entry : ump.entrySet()) {
            int freq = entry.getValue();
            if (freq > maxfreqsofar) {
                maxfreqsofar = freq;
            }
        }

        System.out.println("The minimum number of operations required to make all elements equal is: " + (n - maxfreqsofar));
    }
}