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.IOException;
import java.io.InputStream;
import java.util.ArrayList;


public class Solution {
    public static void main(String[] args) throws IOException {
        int i, j;
        FastReader in = new FastReader(System.in);
        StringBuilder sb = new StringBuilder();
        boolean testcases = true;
        int t = testcases ? in.nextInt() : 1;
        int to = 0;
        while (to++ < t) {
           char arr[]=in.next().toCharArray();
           int n=arr.length;
           int freq[]=new int[10];
           for(char ch:arr)
               freq[ch-'0']++;
           int ans=0;
           for(int x:freq)
               ans=Math.max(ans,x);
           int fr[]=new int[100];
           for(i=0;i<100;i++){
               if(i%11==0)
                   continue;
               char f=(char)((i%10)+'0');
               char s=(char)((i/10)+'0');
               int f1=0,c=0;
               for(j=0;j<n;j++){
                   if(arr[j]==f && f1==0)
                       f1=1;
                   if(arr[j]==s && f1==1){
                       f1=0;
                       c++;
                   }
               }
               fr[i]=c;

           }
           for(int x:fr) {
               ans = Math.max(ans, 2 * x);

           }
           sb.append(n-ans).append("\n");



        }
        System.out.print(sb);
    }
}
class FastReader {

    byte[] buf = new byte[2048];
    int index, total;
    InputStream in;

    FastReader(InputStream is) {
        in = is;
    }

    int scan() throws IOException {
        if (index >= total) {
            index = 0;
            total = in.read(buf);
            if (total <= 0) {
                return -1;
            }
        }
        return buf[index++];
    }

    String next() throws IOException {
        int c;
        for (c = scan(); c <= 32; c = scan()) ;
        StringBuilder sb = new StringBuilder();
        for (; c > 32; c = scan()) {
            sb.append((char) c);
        }
        return sb.toString();
    }

    int nextInt() throws IOException {
        int c, val = 0;
        for (c = scan(); c <= 32; c = scan()) ;
        boolean neg = c == '-';
        if (c == '-' || c == '+') {
            c = scan();
        }
        for (; c >= '0' && c <= '9'; c = scan()) {
            val = (val << 3) + (val << 1) + (c & 15);
        }
        return neg ? -val : val;
    }

    long nextLong() throws IOException {
        int c;
        long val = 0;
        for (c = scan(); c <= 32; c = scan()) ;
        boolean neg = c == '-';
        if (c == '-' || c == '+') {
            c = scan();
        }
        for (; c >= '0' && c <= '9'; c = scan()) {
            val = (val << 3) + (val << 1) + (c & 15);
        }
        return neg ? -val : val;
    }
}


