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).
import sys

def main():
    n = int(input())
    arr=list(map(int, sys.stdin.readline().split()))
    a=0
    b=0
    c=0
    for val in arr:
        if val == 1:
            a+=1
        elif val == 2:
            b+=1
        else:
            c+=1
    
    print(n-max(a,b,c))

    
    return None

main()