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.*;


import java.util.ArrayList;
import java.util.Arrays;

import java.util.Collections;
import java.util.HashMap;
import java.util.StringTokenizer;



public class Main {

  public static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));

  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[] nextSArray() {
      String sr[] = null;
      try {
        sr = br.readLine().trim().split(" ");
      } catch (IOException e) {
        e.printStackTrace();
      }
      return sr;
    }

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

      return str;
    }
  }



  public static void main(String[] args) throws Exception {
    FastReader sc = new FastReader();



    int t1 = sc.nextInt();
    for (int t = 0; t < t1; ++t) {
     String s=sc.nextLine();
     int n=s.length();
     HashMap<Character,Integer>hm=new HashMap<>();


     for(int i=0;i<n;i++)
     {
       char k=s.charAt(i);
       if(hm.containsKey(k))
         hm.put(k,hm.get(k)+1);
       else
         hm.put(k,1);
     }
     int max=Integer.MIN_VALUE;

     for(Character r:hm.keySet())
     {
       if(max<hm.get(r))
       {
         max=hm.get(r);

       }
     }
     int max2=Integer.MIN_VALUE;
    for(char ch1='0';ch1<='9';++ch1)
      {


        for(char ch2='0';ch2<='9';++ch2)
        {
          int k=0;
          boolean flag=true;
          for(int i=0;i<n;++i) {
            char ch3 = s.charAt(i);

            if (flag && ch3 == ch1) {
              flag = false;
              ++k;
            } else if (!flag && ch3 == ch2) {
              ++k;
              flag = true;
            }
          }
         // System.out.println(ch1+" "+ch2+" "+k);
          if(k%2==1)
            --k;
          max2=Math.max(k,max2);
        }

      }
    out.println(n-Math.max(max,max2));
    }
    out.close();



  }

}
// out.println(al.toString().replaceAll("[\\[|\\]|,]",""));