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 Self;

import java.util.Scanner;
import java.util.Set;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.Queue;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.PriorityQueue;

public class Main {

	static FastReader scn = new FastReader();

	static class FastReader {
		BufferedReader br;
		StringTokenizer st;

		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}
	}

	static int mod = (int) (1e9 + 7);

	public static void main(String[] args) {

		int t = scn.nextInt();
		StringBuilder sb = new StringBuilder();

		while (t-- > 0) {

			String str = scn.next();
			sb.append(find(str) + "\n");

		}

		System.out.println(sb);

	}

	private static int find(String str) {

		int ans = str.length();

		for (char ch1 = '0'; ch1 <= '9'; ch1++) {

			for (char ch2 = '0'; ch2 <= '9'; ch2++) {

				if (ch1 == ch2)
					continue;

				int c1 = 0, c2 = 0;
				StringBuilder sb = new StringBuilder();

				for (int i = 0; i < str.length(); i++) {

					if (str.charAt(i) == ch1) {
						sb.append(ch1);
						c1++;
					}

					else if (str.charAt(i) == ch2) {
						sb.append(ch2);
						c2++;
					}

				}

				ans = Math.min(ans, Math.min(str.length() - c1, str.length() - c2));

				if (c1 > 0 && c2 > 0) {
					int i = 1;
					StringBuilder temp = new StringBuilder();
					temp.append(sb.charAt(0));

					while (i < sb.length()) {
						if (sb.charAt(i) != sb.charAt(i - 1)) {
							temp.append(sb.charAt(i));
						}

						i++;

					}

					if (temp.length() % 2 == 1) {
						temp = new StringBuilder(temp.substring(0, temp.length() - 1));
					}

					if (check(temp.toString()))
						ans = Math.min(ans, str.length() - temp.length());
				}
			}

		}

		return ans;

	}

	public static boolean check(String str) {

		for (int i = 0; i < str.length(); i++) {

			int idx = (i + 2) % str.length();
			if (str.charAt(i) != str.charAt(idx))
				return false;

		}

		return true;

	}

	public static long[] longInput(int n) {

		long[] arr = new long[n];

		for (int i = 0; i < n; i++) {
			arr[i] = scn.nextLong();
		}

		return arr;

	}

	public static int[] input(int n) {

		int[] arr = new int[n];

		for (int i = 0; i < n; i++) {
			arr[i] = scn.nextInt();
		}

		return arr;

	}

}
