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

def best(case):
    if len(case) == 0 or len(case) == 2:
        return 0

    best = max(Counter(case).items(), key=lambda x: x[1])[1]
    for i in range(10):
        for j in range(10):
            looking_for = i
            first = True
            length = 0
            for c in case:
                if int(c) == looking_for and first:
                    first = False
                    looking_for = j
                elif int(c) == looking_for and not first:
                    first = True
                    looking_for = i

                    # We found a pair.
                    length += 2

            if length > best:
                best = length
    # Best is the best we can do.
    return len(case) - best

def main(cases):
    for case in cases:
        print(best(case))

if __name__ == "__main__":
    cases = []
    count = 1
    for e, line in enumerate(sys.stdin.readlines()):
        if e == 0:
            continue
        cases.append(line.strip())
    main(cases)
