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.*;
import java.io.*;

public class Solution {
    public static int cycles = 0;

    public static int[] nextArray(FastReader sc1, int n) {
        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = sc1.nextInt();
        }
        return arr;
    }

    public static void printMatrix(int[][] mat){
        for(int i=0; i<mat.length; i++){
            for(int j=0; j<mat[0].length; j++){
                System.out.print(mat[i][j]+" ");
            }
            System.out.println();
        }
        System.out.println();
    }

    public static void dfs(int node, int[][] adj, int n, int pass, int[] vis){
        vis[node] = pass;
        for(int i=0; i<n; i++){
            if(adj[node][i] == 1 && vis[i]==0){
                dfs(i, adj, n, pass, vis);
            }
        }
    }

    public static void main(String[] args) {
        FastReader sc1 = new FastReader();
        StringBuilder sb = new StringBuilder();

        int tc = Integer.parseInt(sc1.nextLine());
        int ch = 0;

        while(ch<tc){
            String str = sc1.nextLine();
            int res = Integer.MAX_VALUE;

            for(int i=0; i<10; i++){
                for(int j=0; j<10; j++){
                    int found = 0;
                    int got = 0;
                    for(int k=0; k<str.length(); k++){
                        int asci = (int)str.charAt(k) - 48;
                        if(asci == i && got%2==0){
                            found++;
                            got++;
                        }
                        else if(asci == j && got%2!=0){
                            found++;
                            got++;
                        }
                    }
                    if(i!=j && found %2 != 0){
                        found--;
                    }
                    int swapped = str.length() - found;
                    //System.out.println(i+" "+j+" "+swapped+" "+found);
                    res = Math.min(res, swapped);
                }
            }

            sb.append(res+"\n");
            ch++;
        }
        System.out.print(sb.toString());
    }

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}