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 codeforces;
import java.io.PrintWriter;
import java.util.*;
public class codeforces {
	public static void main(String[] args) {
		PrintWriter out=new PrintWriter(System.out);
    	Scanner s=new Scanner(System.in);  
    	int T=s.nextInt();
		for (int tt=0; tt<T; tt++) {
			char[] a=s.next().toCharArray();
			int[] counts=new int[10];
			for (char c:a) counts[c-'0']++;
			Arrays.sort(counts);
			int maxLength=counts[counts.length-1];
			for (int first=0; first<10; first++) {
				for (int second=0; second<10; second++) {
					int len=0;
					for (char c:a) {
						if (len%2==0) {
							if (c-'0'==first) len++;
						}
						else {
							if (c-'0'==second) len++;
						}
					}
					if(len%2!=0) {
						if(first!=second) {
							len--;
						}
						
					}
					//System.out.println(first+" "+second+" "+len);
					maxLength=Math.max(maxLength, len);
				}
			}
			System.out.println(a.length-maxLength);
		}
    	out.close();
	    s.close();
	}
	
	static void sort(int[] a) {
		ArrayList<Integer> l=new ArrayList<>();
		for (int i:a) l.add(i);
		Collections.sort(l);
		for (int i=0; i<a.length; i++) a[i]=l.get(i);
	}
	static void sortcol(long a[][],int c) {
		Arrays.sort(a, (x, y) -> {
			if (x[c] != y[c]) return(int)( x[c] - y[c]);
			return (int)(y[0] - x[0]);
		});
	}
 
}

