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 java.util.* ; 
public class GoodString{

     public static void main(String []args){
        Scanner sc1 = new Scanner(System.in); 
        int test = sc1.nextInt(); 
        
        while(test>0) {
            String s = sc1.next(); 
            int result =0; 
            Map<Character,Integer> obj = new HashMap<Character,Integer>(); 
            int n = s.length(); 
            for(int i=0; i<n; i++) {
                if(obj.get(s.charAt(i))==null) {
                    obj.put(s.charAt(i) ,1); 
                }
                
                else {
                    obj.put(s.charAt(i), obj.get(s.charAt(i))+1) ; 
                }
            }
            
            Object array[] = obj.values().toArray(); 
                int max = (int)array[0]; 
            
            for(int i=0; i<array.length; i++) {
                if((int)array[i]>=max) {
                    max = (int)array[i]; 
                }
            }
            result = n - max ; 
            int t =0 ; 
            for(int i=0; i<10; i++) {
                 
                 
                for(int j=0; j<10; j++) {
                    boolean bool = true ;
                    t =0 ; 
                    for(int k=0; k<n; k++) {
                        if(bool && s.charAt(k)==(char)('0'+i)) {
                            bool = false; 
                            t++; 
                        }
                        
                        else if(!bool && s.charAt(k)==(char)('0'+j)) {
                            bool = true ; 
                            t++ ; 
                        }
                    }
                    
                    if(t%2==1) {
                        t-- ; 
                        result = Math.min(result, n-t); 
                    }
                    
                    else {
                        result = Math.min(result, n-t); 
                    }
                }
            }
            
            System.out.println(result) ;
            test-- ;
        }
     }
}