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.Scanner;

public class GoodString {

    public static int check(String str) {
        int len = str.length();
        int ans = len - 2;
        for (int i = 0; i <= 9; i++) {
            for (int j = 0; j <= 9; j++) {
                int now = i;
                int cnt = 0;
                for(int k = 0; k < len; k++) {
                    if(str.charAt(k) - '0' == now) {
                        if(now == i) now = j;
                        else now = i;
                    } else {
                        cnt++;
                    }
                }
                if (now == i) {
                    ans = Math.min(ans, cnt);
                }
            }
        }
        return ans;
    }

    public static int solve(String str) {
        int len = str.length();
        int ans = len - 2;
        char[] strs = str.toCharArray();
        for (int i = 0; i <= 9; i++) {
            for (int j = 0; j <= 9; j++) {
                if (i == j) {
                    continue;
                }
                int cnt = 0;
                int[] except = {i, j};
                for (char c: strs) {
                    if (except[cnt % 2] == (c - '0')) {
                        cnt++;
                    }
                }
                ans = Math.min(ans, len - cnt / 2 * 2);
            }
        }
        return ans;
    }

    public static void main(String[] args) {
        // String str = "98531";
        // String str1 = "100120013";
        // String str2 = "252525252525";
        // System.out.println(solve(str));
        // System.out.println(solve(str1));
        // System.out.println(solve(str2));
        int n = 0;
        Scanner in = new Scanner(System.in);
        n = in.nextInt();
        String ch = in.nextLine();
        while (n > 0) {
            String input = in.nextLine();
            System.out.println(check(input));
            n--;
        }
    }
}