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.
#3
#95831
#100120013
#252525252525
from collections import defaultdict
from itertools import combinations
def solve(s):
    n=len(s)
    if (s[1:]+s[0]==s[n-1]+s[:n-1]):
        return 0 
    d=defaultdict(int)
    maxi=0
    for i in s:
        d[i]+=1 
        maxi=max(maxi,d[i]) 
    if maxi==1:
        return n-2 
    else:
        m=[0,1,2,3,4,5,6,7,8,9]
        d=list(combinations(m,2))
        for i,j in d:
            k=0
            z=0
            while k<n:
                if z%2==0 and s[k]==str(i):
                    z+=1
                elif z%2==1 and s[k]==str(j):
                    z+=1
                k+=1 
            if z%2==1:
                z-=1
            #print(i,j,z)
            maxi=max(maxi,z) 
            k=0
            z=0
            while k<n:
                if z%2==0 and s[k]==str(j):
                    z+=1
                elif z%2==1 and s[k]==str(i):
                    z+=1
                k+=1
            if z%2==1:
                z-=1
            #print(i,j,z)
            maxi=max(maxi,z) 
        return n-maxi
t=int(input())
for _ in range(t):
    s=input()
    print(solve(s))