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

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int t = in.nextInt();
        in.nextLine();
        for (; t > 0; t--) {
            char[] a = in.nextLine().toCharArray();
            int two = a.length - 2;
            int count[] = new int[10];

            for (int i = 0; i < a.length; i++) {
                count[a[i] - '0']++;
            }

            int max = 0;
            for (int i = 0; i < count.length; i++) {
                if (max < count[i]) {
                    max = count[i];
                }
            }
            int allSame = a.length - max;

            ArrayList<ArrayList<ArrayList<Integer>>> c = new ArrayList<ArrayList<ArrayList<Integer>>>();
            for (int i = 0; i < 10; i++) {
                c.add(new ArrayList<ArrayList<Integer>>());
                for (int j = 0; j < 10; j++) {
                    c.get(i).add(new ArrayList<Integer>());
                }
            }
            for (int i = 0; i < a.length; i++) {
                for (int j = 0; j < 10; j++) {
                    if (c.get(j).get(a[i] - '0').isEmpty()
                            || c.get(j).get(a[i] - '0').get(c.get(j).get(a[i] - '0').size() - 1) != a[i] - '0')
                        c.get(j).get(a[i] - '0').add(a[i] - '0');
                    if (c.get(a[i] - '0').get(j).isEmpty()
                            || c.get(a[i] - '0').get(j).get(c.get(a[i] - '0').get(j).size() - 1) != a[i] - '0')
                        c.get(a[i] - '0').get(j).add(a[i] - '0');
                }
            }
            max = 0;
            for (int i = 0; i < 10; i++) {
                for (int j = 0; j < 10; j++) {
                    if (c.get(i).get(j).size() > max) {
                        if (c.get(i).get(j).size() % 2 == 1) {
                            max = c.get(i).get(j).size() - 1;
                        } else {
                            max = c.get(i).get(j).size();
                        }
                    }
                }
            }
            int twoRep = a.length - max;
            System.out.println(Math.min(twoRep, Math.min(two, allSame)));
        }
        in.close();
    }

}