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.Comparator;
import java.util.Map;
import java.util.Scanner;
import java.util.function.Function;
import java.util.stream.Collectors;

public class CF1389C {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int test = scanner.nextInt();
        scanner.nextLine();

        StringBuilder sb = new StringBuilder();
        for (int t = 0; t < test; t++) {
            String line = scanner.nextLine();


            int minRemove = Integer.MAX_VALUE;
            for (int i = 0; i < 10; i++) {
                for (int j = 0; j < 10; j++) {
                    // 1010...
                    boolean waitingFirstChar = true;
                    int charsMet = 0;
                    for (int k = 0; k < line.length(); k++) {
                        int ch = line.charAt(k) - '0';
                        if (waitingFirstChar && ch == i) {
                            charsMet++;
                            waitingFirstChar = false;
                        } else if (!waitingFirstChar && ch == j) {
                            charsMet++;
                            waitingFirstChar = true;
                        }
                    }

                    if (charsMet % 2 == 1) {
                        charsMet--;
                    }
                    int toRemove = line.length() - charsMet;
                    minRemove = Math.min(minRemove, toRemove);
                }
            }
            Map<String, Long> collect =
                    line.chars().mapToObj(e -> String.valueOf((char) e)).collect(Collectors.groupingBy(Function.identity(), Collectors.counting()));
            Long aLong = collect.values().stream().max(Comparator.naturalOrder()).orElse(0l);
            minRemove = Math.min(minRemove, line.length() - (int)(long)aLong);
            sb.append(minRemove).append(System.lineSeparator());
        }
        System.out.println(sb);
    }
}
