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

public class Main {


    private static InputStreamReader inputStreamReader;
    private static BufferedReader reader;
    public static void main(String[] args) throws IOException {
        inputStreamReader = new InputStreamReader(System.in);
        reader = new BufferedReader(inputStreamReader);
        ArrayList<String> strings = new ArrayList<>();

        int t = Integer.parseInt(reader.readLine());

        for(int i =0;i<t;i++){
            strings.add(reader.readLine());
        }
        for(String temp : strings){
            check(temp);
        }

    }

    public static void check(String s) {


        int[] array = new int[10];

        for(char c : s.toCharArray()){
            int n = charToInt(c);
            array[n]++;
        }

        int max = 0;
        for(int i =0;i<10;i++){
            max = Math.max(max, array[i]);
        }

        for(int i =0;i<9;i++){
            for(int j =i+1;j<10;j++){
                if(array[i]+array[j]>max){
                    int sum = array[i] + array[j];
                    int a = array[i];
                    int b = array[j];
                    int num = -1;

                    boolean con = true;
                    for(char c : s.toCharArray()){
                        int n = charToInt(c);

                        if(n==i){
                            if(n==num){
                                sum--;
                                a--;
                                if (sum<=max){
                                    con=false;
                                    break;
                                }
                            }else{
                                num = i;
                            }
                        }else if(n==j){
                            if(n==num){
                                sum--;
                                b--;
                                if (sum<=max){
                                    con=false;
                                    break;
                                }
                            }else{
                                num = j;
                            }
                        }
                    }

                    if(con){
                        if(a!=b){
                            sum--;
                        }
                        max=Math.max(max,sum);
                    }
                }
            }
        }

        System.out.println(s.length()-max);
    }

    public static int charToInt(char c){
        switch (c){
            case '1':return 1;
            case '2':return 2;
            case '3':return 3;
            case '4':return 4;
            case '5':return 5;
            case '6':return 6;
            case '7':return 7;
            case '8':return 8;
            case '9':return 9;
            default: return 0;
        }
    }
}