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).
from collections import Counter
n = int(input())
d = list(map(int,input().split()))
ok = 0
ok1 = 0
ok2 = 0
for i in d:
    if i == 1:
        ok += 1
    elif i == 2:
        ok1 += 1
    else:
        ok2 += 1
mx = max(ok,ok1,ok2)
sm = (ok + ok1 + ok2) - mx
print(sm)

  	 		 	   		  	  	  		  	  		