Let's call left cyclic shift of some string t_1 t_2 t_3 ... t_{n - 1} t_n as string t_2 t_3 ... t_{n - 1} t_n t_1.

Analogically, let's call right cyclic shift of string t as string t_n t_1 t_2 t_3 ... t_{n - 1}.

Let's say string t is good if its left cyclic shift is equal to its right cyclic shift.

You are given string s which consists of digits 0–9.

What is the minimum number of characters you need to erase from s to make it good?

Input

The first line contains single integer t (1 ≤ t ≤ 1000) — the number of test cases.

Next t lines contains test cases — one per line. The first and only line of each test case contains string s (2 ≤ |s| ≤ 2 ⋅ 10^5). Each character s_i is digit 0–9.

It's guaranteed that the total length of strings doesn't exceed 2 ⋅ 10^5.

Output

For each test case, print the minimum number of characters you need to erase from s to make it good.

Example

Input


3
95831
100120013
252525252525


Output


3
5
0

Note

In the first test case, you can erase any 3 characters, for example, the 1-st, the 3-rd, and the 4-th. You'll get string 51 and it is good.

In the second test case, we can erase all characters except 0: the remaining string is 0000 and it's good.

In the third test case, the given string s is already good.
import math

def gcd(a,b): 
    if (b == 0): 
         return a 
    return gcd(b, a%b) 

def lcm(a,b): 
    return (a*b) / gcd(a,b) 

def bs(arr, l, r, x): 
    while l <= r: 
        mid = l + (r - l)//2; 
        if(arr[mid]==x): 
            return arr[mid]
        elif(arr[mid]<x): 
            l = mid + 1
        else: 
            r = mid - 1
    return -1

def swap(list, pos1, pos2): 
      
    list[pos1], list[pos2] = list[pos2], list[pos1] 
    return list

def subarrayBitwiseOR(A): 
    res = set()
    pre = {0} 
    for x in A: 
        pre = {x | y for y in pre} | {x} 
        res |= pre 
    return len(res) 

t = int(input())
for _ in range(t):
    s = input()
    n = len(s)

    maxx = 0

    maxxs = 0

    for i in range(0,10):
        maxxs = max(maxxs, s.count(str(i)))

    for i in range(0,100):
        cnt = 0
        y = str(i)

        if(len(y)==1):
            y = "0"+y

        f = 0
        for j in range(n):
            if(s[j]==y[0]):
                f=1
            elif(s[j]==y[1] and f==1):
                cnt+=1
                f=0
        maxx = max(maxx,cnt)


    print(min(len(s)-2*maxx, len(s)-maxxs))