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 Simple {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int i=0,j=0,k=0;
        int t=0;
        t=sc.nextInt();
        while (t-->0)
        {
            char str[]=sc.next().toCharArray();
            int arr[][]=new int[10][2];
            for (i=1;i<10;i++)
                arr[i][0]=i;
            int n=str.length;
            for (i=0;i<n;i++)
            {
                arr[Character.getNumericValue(str[i])][1]++;
            }
            Arrays.sort(arr, new Comparator<int[]>() {
                @Override
                public int compare(int[] o1, int[] o2) {
                    return o1[1] - o2[1];
                }
            });
            int max=arr[9][1];
            int max2=arr[8][1];
            if (max2==0)
            {
                System.out.println(n-max);
            }
            else
            {
                int fin=0;
                for (k=9;k>0;k--)
                {
                    if (arr[k][1]==0)
                        break;
                    for (j=k-1;j>=0;j--)
                    {
                        if (arr[j][1]==0)
                            break;

                        int a=arr[k][0];
                        int b=arr[j][0];
                        //System.out.println(a+" "+b+" "+i+" "+j);
                        int count=0;
                        i=0;
                        boolean gota=false;
                        while (Character.getNumericValue(str[i])!=a||Character.getNumericValue(str[i])!=b)
                        {
                            if (Character.getNumericValue(str[i])==a)
                            {
                                gota=true;

                                break;
                            }
                            else if (Character.getNumericValue(str[i])==b)
                            {

                                break;
                            }
                            i++;
                        }
                        count++;
                        while (i<n)
                        {
                            if (gota)
                            {
                                if (Character.getNumericValue(str[i])==b)
                                {
                                    gota=false;

                                    count++;
                                }
                            }
                            else
                            {
                                if (Character.getNumericValue(str[i])==a)
                                {
                                    gota=true;

                                    count++;
                                }
                            }
                            i++;
                        }

                        if (count%2==1)
                            count--;
                        fin=Math.max(count,fin);
                    }
                }
                System.out.println(Math.min(n-max,n-fin));
            }
        }






















    }

    static boolean isPrime(long n) {
        if(n < 2) return false;
        if(n == 2 || n == 3) return true;
        if(n%2 == 0 || n%3 == 0) return false;
        long sqrtN = (long)Math.sqrt(n)+1;
        for(long i = 6L; i <= sqrtN; i += 6) {
            if(n%(i-1) == 0 || n%(i+1) == 0) return false;
        }
        return true;
    }
}
