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.
# 25252525
# 22552345 -> 2525
t = int(input())
for _ in range(t) :
    s = input()
    counts = {}
    for i in s:
        if i in counts:
            counts[i] += 1
        else:
            counts[i] = 1

    longest = max(counts.values())
    for a1 in "0123456789":
        for a2 in "0123456789":
            length = 0
            found_a1 = False
            for i in s :
                if found_a1:
                    if i == a2:
                        length += 2
                        found_a1 = False
                else:
                    if i == a1:
                        found_a1 = True
            longest = max(longest, length)
            # try to create the longest even length substring of alternating a1,a2
            # 22552345
            # a1='0', a2='1' ans length = 0
            # a1='2', a2='3' ans length = 2
            # a1='2', a2='5' ans length = 4
    print(len(s) - longest)
