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.
//package tets;
import java.util.*;
import java.io.*;
public class Cf {

	static BufferedReader br;
	private static int GetInt() throws NumberFormatException, IOException {
		int num=Integer.parseInt(br.readLine());
		return num;
	}
	
	private static int[] GetArray() throws NumberFormatException,IOException{
		
		String[]T=br.readLine().split("");
		
		int[]A=new int[T.length];
		
		for(int i=0;i<A.length;i++) {
			A[i]=Integer.parseInt(T[i]);
		}
		
		return A;
	}
	public static void main(String[] args) throws NumberFormatException, IOException {
		// TODO Auto-generated method stub
		
		br=new BufferedReader(new InputStreamReader(System.in));

		int tc=GetInt();
		
		for(int t=0;t<tc;t++) {
			
			String num=br.readLine();
			int[]A=new int[num.length()];
			
			for(int i=0;i<A.length;i++) {
				A[i]=(int)(num.charAt(i)-'0');
			}
			
			long ans=0;
			
			for(int i=0;i<10;i++) {
				for(int j=0;j<10;j++)
				{
					if(i!=j)
					{
						int value=0;
						boolean flag=true;
						
						for(int k=0;k<num.length();k++) {
							
							if(A[k]==i && flag==true)
							{
								value++;
								flag=false;
							}
							
							else if(A[k]==j && flag==false)
							{
								value++;
								flag=true;
							}
						}
						
						if(value%2==0)
						ans=Math.max(ans, value);
						
					}
				}
			}
			
			for(int i=0;i<10;i++)
			{
				int value=0;
				for(int k=0;k<A.length;k++)
				{
					if(A[k]==i)
					value++;
				}
				
				ans=Math.max(ans, value);
			}
			
			System.out.println(A.length-ans);
	     }
	}

}
