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));
    }
}
 

aW1wb3J0IGphdmEudXRpbC4qOwoKcHVibGljIGNsYXNzIE1haW4gewogICAgcHVibGljIHN0YXRpYyB2b2lkIG1haW4oU3RyaW5nW10gYXJncykgewogICAgICAgIGludFtdIGFyciA9IHsxLCAyLCAxLCA0LCAzLCAxfTsKICAgICAgICBpbnQgbiA9IDY7CgogICAgICAgIE1hcDxJbnRlZ2VyLCBJbnRlZ2VyPiB1bXAgPSBuZXcgSGFzaE1hcDxJbnRlZ2VyLCBJbnRlZ2VyPigpOwogICAgICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbjsgKytpKSB7CiAgICAgICAgICAgIGlmICh1bXAuY29udGFpbnNLZXkoYXJyW2ldKSkgewogICAgICAgICAgICAgICAgdW1wLnB1dChhcnJbaV0sIHVtcC5nZXQoYXJyW2ldKSArIDEpOwogICAgICAgICAgICB9IGVsc2UgewogICAgICAgICAgICAgICAgdW1wLnB1dChhcnJbaV0sIDEpOwogICAgICAgICAgICB9CiAgICAgICAgfQoKICAgICAgICBpbnQgbWF4ZnJlcXNvZmFyID0gMDsKICAgICAgICBmb3IgKE1hcC5FbnRyeTxJbnRlZ2VyLCBJbnRlZ2VyPiBlbnRyeSA6IHVtcC5lbnRyeVNldCgpKSB7CiAgICAgICAgICAgIGludCBmcmVxID0gZW50cnkuZ2V0VmFsdWUoKTsKICAgICAgICAgICAgaWYgKGZyZXEgPiBtYXhmcmVxc29mYXIpIHsKICAgICAgICAgICAgICAgIG1heGZyZXFzb2ZhciA9IGZyZXE7CiAgICAgICAgICAgIH0KICAgICAgICB9CgogICAgICAgIFN5c3RlbS5vdXQucHJpbnRsbigiVGhlIG1pbmltdW0gbnVtYmVyIG9mIG9wZXJhdGlvbnMgcmVxdWlyZWQgdG8gbWFrZSBhbGwgZWxlbWVudHMgZXF1YWwgaXM6ICIgKyAobiAtIG1heGZyZXFzb2ZhcikpOwogICAgfQp9Cg==