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.Scanner;
import java.io.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;

public class Solution {
   
        public static void main(String[] args) {

            Scanner sc=new Scanner(System.in);
            int t=sc.nextInt();

            for(int i=0;i<t;i++){
                
                String s=sc.next();
                int[] count=new int[10];

                for(int j=0;j<s.length();j++){
                    int v=Integer.parseInt(Character.toString(s.charAt(j)));
                    count[v]=count[v]+1;
                }

                int maxcount=0;
                for(int j=0;j<10;j++){
                    if(count[j]>maxcount){
                        maxcount=count[j];
                        //System.out.println("m"+maxcount);
                    }
                }
                for(int j=0;j<10;j++){
                    for(int k=j+1;k<10;k++){
                        
                        if(count[j]+count[k]>maxcount){
                            int l=0;
                            int prev=-1;
                            for(int z=0;z<s.length();z++){
                                int c=Integer.parseInt(Character.toString(s.charAt(z)));
                                if((c==j || c==k) && c!=prev){
                                    l++;
                                    prev=c;
                                }
                            }

                            if(l>maxcount){
                                if(l%2==0){
                                    maxcount=l;
                                }
                                else{
                                    maxcount=l-1;
                                }
                                
                            }
                        }
                    }
                }
                int res=s.length()-maxcount;
                System.out.println(res);

                

            }
            
    }
    
            
}
    
