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.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.BufferedWriter;
import java.io.OutputStreamWriter;

public class C {
    public static void main(String[] args) {
        FastReader reader = new FastReader();
        BufferedWriter log = new BufferedWriter(new OutputStreamWriter(System.out));
        int t;
        try {
            t = reader.nextInt();
            for (int i = 0; i < t; i++) {
                char[] sArr = reader.nextLine().toCharArray();

                // should form pair
                int ans = Integer.MIN_VALUE;
                for (int j = 0; j < 10; j++) {
                    for (int k = 0; k < 10; k++) {
                        if (k == j) {
                            continue;
                        }

                        int pairs = 0;
                        boolean parentFound = false;

                        for (int x = 0; x < sArr.length; x++) {
                            if (!parentFound) {
                                if (sArr[x] == '0' + j) {
                                    parentFound = true;
                                }
                            } else {
                                if (sArr[x] == '0' + k) {
                                    parentFound = false;
                                    pairs++;
                                }
                            }
                        }

                        ans = Math.max(ans, (2 * pairs));
                        //System.out.println(j + " " + k + " " + pairs);
                    }
                }

                int freq[] = new int[10];
                for (int j = 0; j < sArr.length; j++) {
                    freq[sArr[j] - '0']++;
                }

                for (int j = 0; j < 10; j++) {
                    ans = Math.max(ans, freq[j]);
                }

                ans = Math.max(ans, 2);

                log.write(sArr.length - ans + "\n");
                log.flush();
            }

            log.close();
        } catch (Exception e) {
            e.printStackTrace();
        }
    }
}

class FastReader {
    BufferedReader br;
    StringTokenizer st;

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

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

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

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

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