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.
def solve(s):
    c = [[0] * 10 for _ in range(10)]
    front_appear = [[False] * 10 for _ in range(10)]
    s_cnt = [0] * 10
    for sd in s:
        d = int(sd)
        s_cnt[d] += 1
        for n in range(10):
            # if n != d and front_appear[n][d]:
            if front_appear[n][d]:
                if n != d:
                    c[n][d] += 1
                    front_appear[n][d] = False
            # else:
                # front_appear[n][d] = True
            front_appear[d][n] = True
            # print(n, d)
            # print(c[n])
    cand = len(s) - max(s_cnt)
    max_pair_cnt = 0
    for i in range(10):
        for j in range(10):
            if i != j:
                max_pair_cnt = max(max_pair_cnt, c[i][j])
    # print(max_pair_cnt)
    # print('s_cnt', s_cnt)
    # for i in range(10):
    #     print(c[i])
    cand2 = len(s) - 2 * max_pair_cnt
    ans = min(cand, cand2)
    return ans


t = int(input())
for _ in range(t):
    s = input()
    print(solve(s))
