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).
'''n=int(input())
List=list(input().split())
List=list(map(int,List))

minimum_replacement=None
for i in range(1,4):
    count=0
    for j in range(n):
        if List[j]!=i:
            count +=1
    if minimum_replacement is None:
        minimum_replacement=count
    elif count<minimum_replacement:
        minimum_replacement=count
print(minimum_replacement)
	   	 	 	    	 	 	 		 	 	  	 	