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.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int t = sc.nextInt();
        for (int tc = 0; tc < t; ++tc) {
            String s = sc.next();

            System.out.println(solve(s));
        }

        sc.close();
    }

    static int solve(String s) {
        @SuppressWarnings("unchecked")
        List<Integer>[] indexLists = new List[10];
        for (int i = 0; i < indexLists.length; ++i) {
            indexLists[i] = new ArrayList<>();
        }

        for (int i = 0; i < s.length(); ++i) {
            indexLists[s.charAt(i) - '0'].add(i);
        }

        int maxLength = Arrays.stream(indexLists).mapToInt(List::size).max().getAsInt();

        for (int d1 = 0; d1 <= 9; ++d1) {
            for (int d2 = 0; d2 <= 9; ++d2) {
                if (d1 != d2) {
                    maxLength = Math.max(maxLength, computeLength(indexLists[d1], indexLists[d2]));
                }
            }
        }

        return s.length() - maxLength;
    }

    static int computeLength(List<Integer> indexList1, List<Integer> indexList2) {
        int result = 0;
        int index1 = 0;
        int index2 = 0;
        int lowerIndex = -1;
        while (true) {
            while (index1 != indexList1.size() && indexList1.get(index1) < lowerIndex) {
                ++index1;
            }
            if (index1 == indexList1.size()) {
                break;
            }
            lowerIndex = indexList1.get(index1);
            ++index1;

            while (index2 != indexList2.size() && indexList2.get(index2) < lowerIndex) {
                ++index2;
            }
            if (index2 == indexList2.size()) {
                break;
            }
            lowerIndex = indexList2.get(index2);
            ++index2;

            result += 2;
        }

        return result;
    }
}