There is a given sequence of integers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub>, where every number is from 1 to 3 inclusively. You have to replace the minimum number of numbers in it so that all the numbers in the sequence are equal to each other.
The first line contains an integer *n* (1 ≤ *n* ≤ 10<sup class="upper-index">6</sup>). The second line contains a sequence of integers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 3).
num = int(input())
arr = input().split()
arr = [int(x) for x in arr]
n1 = arr.count(1)
n2 = arr.count(2)
n3 = arr.count(3)
max_recurance = max(n1, n2, n3)
print(n1 + n2 + n3 - max_recurance)

	 		  		 					  	    	  	  	 		