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.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.StringTokenizer;

public class GoodString {
    public static void main(String[] args) {
        FastReader input=new FastReader();
        int t=input.nextInt();
        for(int i=0;i<t;i++)
        {
            String s = input.next();
            int max=Integer.MIN_VALUE;
            for(int j=0;j<10;j++)
            {
                for(int k=0;k<10;k++)
                {
                    char a=(char)(j+'0');
                    char b=(char)(k+'0');
                    int flag=0;
                    int c=0;
                    for(int l=0;l<s.length();l++)
                    {
                        if(flag==0 && s.charAt(l)==a)
                        {
                            c++;
                            flag=1;
                        }
                        else if(flag==1 && s.charAt(l)==b)
                        {
                            c++;
                            flag=0;
                        }
                    }
                    if(c%2!=0)
                    {
                        c--;
                    }
                    max=Math.max(max,c);
                }
            }
            int max1=Integer.MIN_VALUE;
            for(int j=0;j<10;j++)
            {
                char a=(char)(j+'0');
                int count=0;
                for(int k=0;k<s.length();k++)
                {
                    if(s.charAt(k)==a)
                    {
                        count++;
                    }
                }
                max1=Math.max(max1,count);
            }
            max=Math.max(max,max1);
            System.out.println(s.length()-max);
        }

    }
    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;
        }
    }
}
