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 sys import stdin
for _ in range(int(input())):
    a = stdin.readline().rstrip()
    d = {}
    le = len(a)
    for i in range(le):
        x = d.get(a[i], 0)
        if x:
            d[a[i]]+=1
        else:
            d[a[i]]=1
    d = dict(sorted(d.items(), key=lambda x: x[1], reverse=True))
    m = max(d.values())
    done = []
    for i, j in d.items():
        for k, l in d.items():
            if i!=k and i+k not in done:
                done.append(i+k)
                done.append(k + i)
                if min([j,l])*2 > m:
                    start = []
                    for test in range(le):
                        if not start:
                            if a[test]in [i,k]:
                                start.append(a[test])
                        else:
                            if start[-1]!= a[test] and a[test] in [i,k]:
                                start.append(a[test])
                    if len(start)>m:
                        if start[0]==start[-1]:
                            m = len(start)-1
                        else:
                            m = len(start)
    print(le - m)