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.math.*;
import java.io.*;

public class bae {
	static AnotherReader sc;
	static PrintWriter out;
	public static void main(String[] args) throws IOException {
		sc=new AnotherReader();
	    int t = sc.nextInt();
	    while(t-->0){
	        String s=sc.nextLine();
    		int maxi=0;
    		for(int i=0;i<10;i++) {
    			for(int j=0;j<10;j++) {
    				int c1=0,c2=0,c3=0;
    				for(int k=0;k<s.length();k++) {
    					int n=Integer.parseInt(Character.toString(s.charAt(k)));
    					if(n==i && c1==c2)
    						c1+=1;
    					else if(n==j && c1>c2)
    						c2+=1;
    				}
    				if(i==j)
    					c3=c1+c2;
    				maxi=Math.max(maxi,Math.max(c2*2,c3));
    			}
    		}
    		System.out.println(s.length()-maxi);
	    }
		
	}
	
	
	

	static class AnotherReader{BufferedReader br; StringTokenizer st;
    AnotherReader()throws FileNotFoundException{
    br=new BufferedReader(new InputStreamReader(System.in));}
    AnotherReader(int a)throws FileNotFoundException{
    br = new BufferedReader(new FileReader("input.txt"));}
    String next()throws IOException{
    while (st == null || !st.hasMoreElements()) {try{
    st = new StringTokenizer(br.readLine());}
    catch (IOException  e){ e.printStackTrace(); }}
    return st.nextToken(); } int nextInt() throws IOException{
    return Integer.parseInt(next());}
    long nextLong() throws IOException
    {return Long.parseLong(next());}
    double nextDouble()throws IOException { return Double.parseDouble(next()); }
    String nextLine() throws IOException{ String str = ""; try{
    str = br.readLine();} catch (IOException e){
    e.printStackTrace();} return str;}}
	
}
