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.io.*;
import java.math.BigInteger;
import static java.lang.Math.*;
 
public class Main
{
	static final int mod = (int)1e9+7;
	public static void main(String[] args) throws Exception
	{
		FastReader in = new FastReader();
		PrintWriter out = new PrintWriter(System.out);
		int test = in.nextInt();
		while(test-- > 0)
		{
			char[] s = in.next().toCharArray();
			int n = s.length;
			int ans = n;
			for(int i = 0; i < 10; i++) {
				for(int j = 0; j < 10; j++) {
					int k = 0, c = 0;
					while(k < n) {
						if(c % 2 == 0 && s[k] - '0' == i) {
							c++;
						}
						else if(c % 2 != 0 && s[k] - '0' == j) {
							c++;
						}
						k++;
					}
					if(i == j) {
						ans = min(ans, n - c);
					}
					else {
						if(c % 2 != 0)
							c--;
							ans = min(ans, n - c);
					}
				}
			}
			out.println(ans);
		}
		out.flush();
	}
}

class FastReader
{
	BufferedReader br;
	StringTokenizer st;
 
	public FastReader()
	{
	    br = new BufferedReader(new InputStreamReader(System.in));
	}
 
	public String next() throws IOException
	{
	    if(st == null || !st.hasMoreElements())
	    {
	        st = new StringTokenizer(br.readLine());
	    }

	    return st.nextToken();
	}

	public boolean hasNext() throws IOException
	{
		if(st != null && st.hasMoreElements())
		{
			return true;
		}

		String s = br.readLine();
		if(s == null) {
			return false;
		}

		st = new StringTokenizer(s);

		return st.hasMoreElements();
	}
 
	public int nextInt() throws IOException
	{
	    return Integer.parseInt(next());
	}
 
	public long nextLong() throws IOException
	{
	    return Long.parseLong(next());
	}
 
	public String nextLine() throws IOException
	{
		return br.readLine();
	}
}