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 Main
{
    public static void main(String args[])throws Exception
    {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        PrintWriter pw=new PrintWriter(System.out);
        int t=Integer.parseInt(br.readLine());
        while(t-->0)
        {
            char carr[]=br.readLine().toCharArray();
            TreeSet<Integer> ind[]=new TreeSet[10];
            int n=carr.length;
            for(int i=0;i<=9;i++)
            ind[i]=new TreeSet<>();
            for(int i=0;i<n;i++)
            ind[carr[i]-'0'].add(i);
            int min=n;
            for(int i=0;i<10;i++)
            min=Math.min(min,n-ind[i].size());
            for(int i=0;i<=9;i++)
            {
                for(int j=0;j<=9;j++)
                {
                    if(ind[i].size()>0&&ind[j].size()>0)
                    {
                        int cntr=1;
                        if(ind[i].first()<ind[j].first())
                        {
                            int prev=ind[i].first()+1;
                            int x=1;
                            while(true)
                            {
                                if(x==1)
                                {
                                    if(ind[j].ceiling(prev)==null)
                                    break;
                                    cntr++;
                                    prev=ind[j].ceiling(prev)+1;
                                }
                                else
                                {
                                    if(ind[i].ceiling(prev)==null)
                                    break;
                                    cntr++;
                                    prev=ind[i].ceiling(prev)+1;
                                }
                                x^=1;
                            }
                        }
                        else
                        {
                            int prev=ind[j].first()+1;
                            int x=0;
                            while(true)
                            {
                                if(x==1)
                                {
                                    if(ind[j].ceiling(prev)==null)
                                    break;
                                    //System.out.println("j "+ind[j].ceiling(prev));
                                    cntr++;
                                    prev=ind[j].ceiling(prev)+1;
                                }
                                else
                                {
                                    if(ind[i].ceiling(prev)==null)
                                    break;
                                    //System.out.println("i "+ind[i].ceiling(prev));
                                    cntr++;
                                    prev=ind[i].ceiling(prev)+1;
                                }
                                x^=1;
                            }
                        }
                        min=Math.min(min,n-(cntr-((cntr%2==0)?0:1)));
                    }
                }
            }
            pw.println(min);
        }
        pw.flush();
        pw.close();
    }
}