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.
def check(a,b,string):
    res = ""
    cnt = 0
    for s in string:
        if(s==a or s==b):
            if(s!=res):
                cnt+=1
                res = s
    if(cnt%2):
        cnt-=1
    return cnt
def main():
    string = str(input())
    if(len(set(string))==1):
        print(0)
        return
    elif(len(set(string))==len(string)):
        print(len(string)-2)
        return
    arr = {}
    for x in string:
        if(arr.get(x)==None):
            arr[x]=1
        else:
            arr[x]+=1
    mx = -1
    for x in arr:
        mx = max(mx,arr[x])
    mn = -1
    for x in arr:
        for y in arr:
            if(x!=y):
                temp = check(x,y,string)
                temp2 = check(y,x,string)
                if(max(temp,temp2)>mn):
                    mn = max(temp,temp2)
    print(len(string)-max(mn,mx))
    return

def test():
	t = int(input())
	while t:
		main()
		t-=1
test()
# print(check("12121221"))