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.*;
import java.util.*;

public class Main {

    private static int testCase(char[] s) {
        int[] counts = new int[10];
        int maxCount1 = 0, maxIndex1 = -1;
        int maxCount2 = 0, maxIndex2 = -1;
        StringBuilder sb;
        TreeMap<Integer, Integer> countToIndex = new TreeMap<>();
        int ans = Integer.MAX_VALUE;

        StringBuilder[][] sbArray = new StringBuilder[10][10];

        for (int i = 0; i < 10; i++) {
            for (int j = 0; j < 10; j++) {
                sbArray[i][j] = new StringBuilder();
            }
        }

        for (char c : s) {
            counts[c - '0']++;

            for (int i = 0; i < 10; i++) {
                sbArray[c - '0'][i].append(c);
            }

            for (int i = 0; i < 10; i++) {
                if (i == c - '0') continue;
                sbArray[i][c - '0'].append(c);
            }
        }

        for (int i = 0; i < 10; i++) {
            for (int j = 0; j < 10; j++) {
                if (i == j) {
                    ans = Math.min(ans, s.length - sbArray[i][j].length());
                } else {
                    int toRemove = checkNumToRemove(sbArray[i][j], i, j);
                    ans = Math.min(ans, (s.length - sbArray[i][j].length()) + toRemove);
                }
            }
        }

        return ans;
    }

    private static StringBuilder filter(char[] s, int index1, int index2) {
        StringBuilder sb = new StringBuilder();

        for (char c : s) {
            if (c - '0' == index1 || c - '0' == index2) {
                sb.append(c);
            }
        }

        return sb;
    }

    private static int checkNumToRemove(StringBuilder sb, int index1, int index2) {
        if (sb.length() <= 2) return 0;

        int numRemove = 0;
        char currChar = sb.charAt(0);

        for (int i = 1; i < sb.length(); i++) {
            if (sb.charAt(i) == currChar) {
                numRemove++;
            } else {
                currChar = sb.charAt(i);
            }
        }

        if (((sb.length() - numRemove) & 1) == 0) {
            return numRemove;
        } else {
            return  numRemove + 1;
        }
    }

    public static void main(String[] args) {
        FastScanner in = new FastScanner();
        PrintWriter out = new PrintWriter(System.out);
        int t = in.nextInt();  // Scanner has functions to read ints, longs, strings, chars, etc.
        //in.nextLine();
        for (int i = 1; i <= t; ++i) {
            String s = in.next();

            out.println(testCase(s.toCharArray()));
        }

        out.close();
    }

    private static class FastScanner {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer("");
        String next() {
            while (!st.hasMoreTokens())
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            return st.nextToken();
        }

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

        int[] readArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) a[i] = nextInt();
            return a;
        }

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