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.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashMap;

public final class GoodString {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int t = Integer.parseInt(br.readLine());
        while(t-->0) {
            char[] s = br.readLine().toCharArray();
            HashMap<Integer, Integer> map = new HashMap<>();
            for(int i=0; i<s.length; i++) {
                int num = s[i] - '0';
                if(map.containsKey(num))
                    map.replace(num, map.get(num) + 1);
                else
                    map.put(num, 1);
            }
            int max = 0;
            boolean preFound = false;
            ArrayList<Integer> tempList = new ArrayList<>();
            tempList.add(s.length);
            ArrayList<Integer> keys = new ArrayList<>(map.keySet());
            for(int i=0; i<keys.size(); i++) {
                max = Math.max(max, map.get(keys.get(i)));
            }
            max = s.length - max;
            int count = 0;
            for(int i=0; i<10; i++) {
                for(int j=0; j<10; j++) {
                    if(i != j) {
                        boolean found = false;
                        int tempCount = 0;
                        for(int k=0; k<s.length; k++) {
                            if(s[k] - '0' == i)
                                found = true;
                            else if(s[k] - '0' == j) {
                                if(found) {
                                    tempCount++;
                                    count = Math.max(tempCount, count);
                                }
                                found = false;
                            }
                        }
                    }
                }
            }
            count = s.length - 2 * count;
            int ans = Math.min(count, max);
            System.out.println(ans);
        }
        br.close();
    }
}
