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
a=int(input())
for i in range(a):
    total=0
    s=input()
    ans=[]
    count=1
    maxa=0
    for i in range(1,len(s)):
        if(s[i]==s[i-1]):
            count+=1
        else:
            ans.append([count,int(s[i-1])])
            
            total+=count-1
            count=1
            
            
    ans.append([count,int(s[-1])])
   
    total+=count-1
    mini=math.inf
    for i in range(10):
        mini=min(mini,len(s)-s.count(str(i)))
  
    
    temp=[]
    for i in range(len(ans)):
        temp.append(ans[i][1])
    maxa=0
    
    for i in range(10):
        for j in range(10):
            c1=0
            if(i==j):
                continue;
            flag=0
            for t in range(len(temp)):
                if(flag==0):
                    if(temp[t]==i):
                        c1+=1
                        flag=1
                if(flag==1):
                    if(temp[t]==j):
                        c1+=1
                        flag=0
            if(c1%2==0):
                maxa=max(maxa,c1)
    
    print(min(mini,total+len(temp)-maxa))
    
                
    
