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.*;
import java.io.*;
public class MyClass {
    static PrintStream w;
    public static void main(String args[]) {
      
        Scanner sc = new Scanner(System.in);
         w=System.out;
        
        int t=Integer.parseInt(sc.nextLine());
        
      A: while(t-->0){
         String s = sc.nextLine();
         int n=s.length();
         int[] ar = new int[10];
         List<Integer>[] ls = new ArrayList[10];
         for(int i=0; i<10; i++)
         ls[i]=new ArrayList<>();
         int ite=0;
         for(char c : s.toCharArray()){
             ls[c-'0'].add(ite++);
             ar[c-'0']++;
         }
         int min=n;
         for(int i=0; i<10; i++){
             min=Math.min(min, n-ar[i]);
         }
         
         for(int i=0; i<10; i++){
             for(int j=0; j<10; j++){
                 if(j==i)
                 continue;
                 min=Math.min(min, n-util(s,n,i,j));
             }
         }
         
         w.println(min);
       
         }
    }

    static int util(String s, int n, int a, int b){
        int c1=a+'0';
        int c2=b+'0';
        int count=0;
        int ite=0;
        boolean flag=true;
        while(ite<n){
            int c=s.charAt(ite++);
            if(flag){
                if(c==c1){
                    count++;
                    flag=false;
                }
            }else{
                if(c==c2){
                    count++;
                    flag=true;
                }
            }
        }
        if(count%2!=0 || flag==false){
            count--;
        }
        return count;
    }

}