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 javax.net.ssl.SSLContext;

import java.math.*;
import java.io.*;
import java.text.*;
public class Main {
	static final int maxn=100110;
	static int n=0;
	static int[] d=new int[maxn];
	
	static public void solve() throws IOException
	{
		int T=nextInt();
		while(T-->0)
		{
			String s=next();
			int ans=s.length()-1;
			int[] cnt=new int[10];
			Arrays.fill(cnt,0);
			for(int i=0;i<s.length();++i)
				cnt[s.charAt(i)-'0']++;
			for(int i=0;i<10;++i)
				ans=Math.min(ans,s.length()-cnt[i]);
			for(int x=0;x<=10;++x)
				for(int y=0;y<=10;++y)
				{
					if(x==y) continue;
					int delCnt=0;
					int cur=x;
					int nxt=y;
					for(int i=0;i<s.length();++i)
						if(s.charAt(i)-'0'==cur)
						{
							int tmp=cur;
							cur=nxt;
							nxt=tmp;
						}
						else 
						{
							delCnt++;
						}
					if(cur==y)
						delCnt++;
					ans=Math.min(ans,delCnt);
				}
			out.println(ans);
		}
	}
	
	public static void main(String[] args) {
		 try {
	            reader = new BufferedReader(new InputStreamReader(System.in));
	            tokenizer = null;
	            out = new PrintWriter(System.out);
	            solve();
	            reader.close();
	            out.close();
	        } catch (Exception e) {
	            e.printStackTrace();
	            System.exit(1);
	        }
    }
 
    static BufferedReader reader;
    static StringTokenizer tokenizer;
    static PrintWriter out;
 
    static int nextInt() throws IOException {
        return Integer.parseInt(next());
    }
 
    static long nextLong() throws IOException {
        return Long.parseLong(next());
    }
 
    static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }
 
    static String next() throws IOException {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(reader.readLine());
        }
        return tokenizer.nextToken();
    }
}
