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 math import ceil
n = int(input())
my_list = input().split()[:n]


new_list = []
for i in my_list:
    if i not in new_list:
        new_list.append(i)
new_list = sorted(new_list)
total_list = []

for i in new_list:
    total = len(my_list) - my_list.count(i)
    total_list.append(total)

print(min(total_list))

 	   		 	    		   	   								