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).
#    {_@_A_b_d_u_l___M_a_l_i_k_@_}

#     A. 123-sequence

a = int(input());b = input().split()
m = b.count('1'); m1 = b.count('2'); m2 = b.count('3')
m3 = max(m,m1,m2); print(len(b) - m3)

#    {_@_A_b_d_u_l___M_a_l_i_k_@_}
