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.
#!/usr/bin/env python3

import math

def is_good(x):
    x = str(x)
    return ((x[1:] + x[0]) == (x[-1] + x[:-1]))

def best_if_even(s, i, j):
    i = str(i)
    j = str(j)
    taken = None
    skip = 0
    for c in s:
        if taken is None and c == i:
            taken = 0
        elif taken is None and c == j:
            taken = 1
        elif taken == 0 and c == j:
            taken = 1
        elif taken == 1 and c == i:
            taken = 0
        else:
            skip += 1
    if (len(s) - skip) % 2 == 1:
        skip += 1
    return skip

def main():
    # All 1 digit
    # All 2 digit
    # 3 digit (only repeating 000, 111, ..., 999)
    # 4 digit abab (a can equal b)


    # if even, ab...ab
    # if odd, all same

    for _ in range(int(input())):
        s = input()
        ans = len(s)
        for i in range(10):
            ans = min(ans, sum(c != str(i) for c in s))
            for j in range(10):
                ans = min(ans, best_if_even(s, i, j))
        print(ans)

if __name__ == "__main__":
    main()
