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, gettrace

if gettrace():
    inputi = input
else:
    def input():
        return next(stdin)[:-1]


    def inputi():
        return stdin.buffer.readline()


def solve():
    ss = list(map(int, list(input())))
    best = 0
    for i in range(10):
        for j in range(10):
            next = i
            count = 0
            for s in ss:
                if s == next:
                    next = i if next == j else j
                    count += 1
            if next == j and i != j:
                count -= 1
            best = max(best, count)
    # counts = [[0]*10 for _ in range(10)]
    # for s in ss:
    #     for i in range(10):
    #         counts[i][s] = counts[s][i] + 1
    # best = 0
    # besti = 0
    # bestj = 0
    # for i in range(10):
    #     for j in range(10):
    #         if counts[i][j] > best:
    #             best = counts[i][j]
    #             besti = i
    #             bestj = j
    # if best%2 == 1 and besti != bestj:
    #     best -= 1
    print(len(ss) - best)


def main():
    t = int(inputi())
    for _ in range(t):
        solve()


if __name__ == "__main__":
    main()