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).
input_count = int(input("Enter number count:"))
input_nums = input("Enter numbers:")
input_tokens = input_nums.split(" ")

count_1 = input_tokens.count("1")
count_2 = input_tokens.count("2")
count_3 = input_tokens.count("3")

count_array = [count_1, count_2, count_3]
count_array.remove(max(count_array))

result = sum(count_array)
print(result)