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.
from collections import Counter

n = int(input())
for _ in range(n):
    s = input()
    c = Counter(s).most_common()
    a = c[0][1]
    m = c[0][1]
    arr = [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]]
    # arr = [[0] * 10] * 10
    # arr = np.zeros((10, 10), dtype=int)
    for i in range(9):
        arr.append([0, 0, 0, 0, 0, 0, 0, 0, 0, 0])
    # print(arr)
    for i in s:
        p = int(i)
        for j in range(10):
            # print(p, j)
            if p > j:
                if arr[j][p] == 1 or (arr[j][p] == 0 and arr[p][j] == 0):
                    arr[j][p] = 0
                    arr[p][j] += 1
                    if arr[p][j] > m:
                        m = arr[p][j]
            elif p < j:
                if arr[p][j] == 0:
                    arr[p][j] = 1
                    arr[j][p] += 1
                    if arr[j][p] > m:
                        m = arr[j][p]
            # print(arr)
    # print(arr)
    # print(a, m, len(s))
    if m % 2 == 1:
        m -= 1
    if a > m:
        print(len(s) - a)
    else:
        print(len(s) - m)
