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__":
    t = int(input())
    lst = list(map(int,input().strip().split()))
    count_1 = count_2 = count_3 = 0
    for i in range(len(lst)):
        if lst[i] == 1 :
            count_1 += 1
        elif lst[i] == 2 :
            count_2 += 1
        else:
            count_3 += 1
    print(t - max(count_1,count_2,count_3))
