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).

if __name__ == "__main__":
    n = int(input())
    numbers = list(map(int,input().split()))
    uno = numbers.count(1)
    dos = numbers.count(2)
    tres = numbers.count(3)
    if uno > dos and uno > tres:
        print(dos+tres)
    elif dos > uno and dos > tres:
        print(uno + tres)
    elif tres > dos and tres > uno:
        print(uno+dos)
 	 	  	  			        		   		 	