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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.StringTokenizer;

public final class CodeForces658C {
    public static void main(String args[]){
        FastReader sc=new FastReader(); 
        PrintWriter out = new PrintWriter(System.out);
        int t = sc.nextInt();
        while(t-->0){
            String st = sc.nextLine();
            int l = st.length();
            int f[] = new int[10];
            int ans = 0;
            for(char i='0';i<='9';i++){
                for(char j='0';j<='9';j++){
                    ans = Math.max(ans,solve(st,i,j));
                }
            }
            for(int i=0;i<l;i++)
                f[st.charAt(i)-'0']++;
            for(int i=0;i<=9;i++)
                ans = Math.max(ans,f[i]);
            System.out.println(l-ans); 
        }
        out.flush();
        out.close();
    }
    
    public static int solve(String st,char a,char b){
        char n = a;
        int l = st.length();
        int c=0;
        for(int i=0;i<l;i++){
            if(st.charAt(i)==n){
                c++;
                if(n==a)
                    n = b;
                else
                    n = a;
            }
        }
        if(n == b)
            return c-1;
        return c;
    }
    
    static class FastReader 
    { 
        BufferedReader br; 
        StringTokenizer st; 
  
        public FastReader() 
        { 
            br = new BufferedReader(new
                     InputStreamReader(System.in)); 
        } 
  
        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                { 
                    st = new StringTokenizer(br.readLine()); 
                } 
                catch (IOException  e) 
                { 
                } 
            } 
            return st.nextToken(); 
        } 
  
        int nextInt() 
        { 
            return Integer.parseInt(next()); 
        } 
  
        long nextLong() 
        { 
            return Long.parseLong(next()); 
        } 
  
        double nextDouble() 
        { 
            return Double.parseDouble(next()); 
        } 
  
        String nextLine() 
        { 
            String str = ""; 
            try
            { 
                str = br.readLine(); 
            } 
            catch (IOException e) 
            { 
                
            } 
            return str; 
        } 
    } 
}
