/* package whatever; // don't place package name! */
//Write Brute Force solution for FInding the number with highest frequency in an array
import java.util.*;
import java.lang.*;
import java.io.*;
 
/* Name of the class has to be "Main" only if the class is public. */
class Ideone
{
	public static void main (String[] args) throws java.lang.Exception
	{
		// your code goes here
		int arr[] = {1,1,2,3,2,2,3,3,5,6,5,6,6,1,1};
		int n = arr.length;
		int maxFreq=0;
		for(int i = 0;i<n;i++){
		   int count = 0;
		   for(int j =0;j<n;j++){
		   	if(arr[i] == arr[j]){
		   		count++;
		   	}
		   }
		   if(maxFreq < count){
		    maxFreq = count;
		   }
		}
		int result = n - maxFreq;
		System.out.println("Minimum deletions required: " + result);
	}
}

LyogcGFja2FnZSB3aGF0ZXZlcjsgLy8gZG9uJ3QgcGxhY2UgcGFja2FnZSBuYW1lISAqLwovL1dyaXRlIEJydXRlIEZvcmNlIHNvbHV0aW9uIGZvciBGSW5kaW5nIHRoZSBudW1iZXIgd2l0aCBoaWdoZXN0IGZyZXF1ZW5jeSBpbiBhbiBhcnJheQppbXBvcnQgamF2YS51dGlsLio7CmltcG9ydCBqYXZhLmxhbmcuKjsKaW1wb3J0IGphdmEuaW8uKjsKCi8qIE5hbWUgb2YgdGhlIGNsYXNzIGhhcyB0byBiZSAiTWFpbiIgb25seSBpZiB0aGUgY2xhc3MgaXMgcHVibGljLiAqLwpjbGFzcyBJZGVvbmUKewoJcHVibGljIHN0YXRpYyB2b2lkIG1haW4gKFN0cmluZ1tdIGFyZ3MpIHRocm93cyBqYXZhLmxhbmcuRXhjZXB0aW9uCgl7CgkJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJCWludCBhcnJbXSA9IHsxLDEsMiwzLDIsMiwzLDMsNSw2LDUsNiw2LDEsMX07CgkJaW50IG4gPSBhcnIubGVuZ3RoOwoJCWludCBtYXhGcmVxPTA7CgkJZm9yKGludCBpID0gMDtpPG47aSsrKXsKCQkgICBpbnQgY291bnQgPSAwOwoJCSAgIGZvcihpbnQgaiA9MDtqPG47aisrKXsKCQkgICAJaWYoYXJyW2ldID09IGFycltqXSl7CgkJICAgCQljb3VudCsrOwoJCSAgIAl9CgkJICAgfQoJCSAgIGlmKG1heEZyZXEgPCBjb3VudCl7CgkJICAgIG1heEZyZXEgPSBjb3VudDsKCQkgICB9CgkJfQoJCWludCByZXN1bHQgPSBuIC0gbWF4RnJlcTsKCQlTeXN0ZW0ub3V0LnByaW50bG4oIk1pbmltdW0gZGVsZXRpb25zIHJlcXVpcmVkOiAiICsgcmVzdWx0KTsKCX0KfQ==