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.*;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.*;



public class Solution {
	public static class FastReader {
			BufferedReader br;
			StringTokenizer root;
			
	 
			public FastReader() {
				br = new BufferedReader(new InputStreamReader(System.in));
			}
	 
			String next() {
				while (root == null || !root.hasMoreTokens()) {
					try {
						root = new StringTokenizer(br.readLine());
					} catch (Exception addd) {
						addd.printStackTrace();
					}
				}
				return root.nextToken();
			}
	 
			int nextInt() {
				return Integer.parseInt(next());
			}
	 
			double nextDouble() {
				return Double.parseDouble(next());
			}
	 
			long nextLong() {
				return Long.parseLong(next());
			}
	 
			String nextLine() {
				String str = "";
				try {
					str = br.readLine();
				} catch (Exception addd) {
					addd.printStackTrace();
				}
				return str;
			}
		}
	 
	public static PrintWriter out = new PrintWriter (new BufferedOutputStream(System.out));
	public static FastReader sc = new FastReader();
 
	static int mod = (int) (1e9+7),MAX=(int)(1e9);

	static char[] a,b;
	public static void main(String[] args) throws IOException{

		int t = sc.nextInt();
		while(t-->0) {
			char[] s = sc.next().toCharArray();
			int n = s.length;
			int ans = n;
			int[] map = new int[10];
			for(char x : s) map[x-'0']++;
			
			for(char c = '0'; c<='9'; ++c){
				ans = Math.min(ans , n - map[c-'0']);
			}
			
			for(char x ='0' ; x<'9'; ++x){
				for(char y=(char) (x+1) ; y<='9'; ++y) {
					ans = Math.min(ans , n - f(s , x , y));
					ans = Math.min(ans , n - f(s , y , x));
				}
			}
			out.println(ans);
		}
		out.close();
	}
	private static int f(char[] s, char x, char y) {
		int len =0;
		char need = x;
		for(int i = 0; i < s.length;++i){
			if(need == s[i]) {
				++len;
				need = (char)(x+y - need);
			}
		}
		return len - len%2;
	}
	 
}
