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).
length = int(input())
inp = list(map(int,input().split()))
inp.sort()
res = 1
temp = 1
for x in range(1,length):
	if inp[x] != inp[x-1]:
		if temp>res:
			res = temp
		temp = 1
	else:
		temp += 1
if inp[-1]==inp[-2] and temp>res:
	res = temp
print(length-res)
