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.
T=int(input()) 
for t in range(T):
    s=input() 
    mx=0
    arr=[]  
    for i in range(10):
        arr.append([])
    cnt=0
    for k in s:
        arr[int(k)].append(cnt) 
        cnt+=1 
    for i in range(9):
        for j in range(i+1,10):
            odd=0
            even=0
            m,n=0,0
            ans=0 
            for k in range((len(arr[i])+len(arr[j]))):
                if m==len(arr[i]) or n==len(arr[j]):
                    break 
                if arr[i][m]<arr[j][n]:
                    even=0
                    m+=1 
                    if odd==0:
                        ans+=1 
                        odd=1 
                else:
                    odd=0 
                    n+=1 
                    if even==0:
                        ans+=1 
                        even=1
            if len(arr[i])!=0 and len(arr[j])!=0:
                if (arr[i][-1]>arr[j][-1] and arr[i][0]>arr[j][0]) or (arr[i][-1]<arr[j][-1] and arr[i][0]<arr[j][0]):
                    ans+=(ans%2) 
                else:
                    ans-=(ans%2)     
            mx=max(mx,ans) 
    for i in range(10):
        mx=max(mx,len(arr[i])) 
    print(len(s)-mx) 
                    
