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 {

    static int solve(char[] arr, char c1, char c2){
        int i = 0, cnt = 0;
        char toFind = c1;
        while(i<arr.length){
            if(arr[i] == c1 && toFind == c1){
                cnt++;
                toFind = c2;
            }
            else if(arr[i] == c2 && toFind == c2){
                cnt++;
                toFind = c1;
            }
            i++;
        }
        if(cnt%2==1 && c1 != c2) cnt--;
        return arr.length-cnt;
    }

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        char[] ref = new char[]{'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'};
        int tst = Integer.parseInt(br.readLine());
        while(tst-->0){
            char[] s = br.readLine().toCharArray();
            int ans = (int)3e5+1;
            for(char x: ref){
                for(char y: ref){
                    ans = Math.min(ans, solve(s, x, y));
                }
            }
            System.out.println(ans);
        }
    }
}
