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).
def seq_123(n,a):
    ca = 0
    cb = 0
    for i in range(n):
        if a[i] == 'a':
            ca += 1
        elif a[i] == 'b':
            cb += 1
    return n - max(ca,cb,n-(ca+cb))




def main():
    n = int(input())
    a = list(map(str,input().split()))
    print(seq_123(n, a))

main()
