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).
from collections import *

def func(intput,mapping,unpack):
    n=intput()
    v=mapping(int)
    hsh=defaultdict(int)
    for e in v: hsh[e]+=1
    v.clear()
    v=[hsh[1],hsh[2],hsh[3]]
    v.sort()
    print(v[1]+v[0])
    

def init(flag=True):
    intput = lambda : int(input())
    mapping = lambda s: list(map(s,input().split()))
    unpack = lambda s: map(s,input().split())
    for _ in range(int(input()) if flag else 1):
        func(intput,mapping,unpack)

if __name__ == '__main__':
    init(False)