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 test(s,c):

    matrix =[[[-1,0],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ]],[[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ]],[[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ]],[[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ]],[[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ]],[[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ]],[[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ]],[[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ]],[[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ]],[[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ],[-1,0 ]]]
    max = 0
    for i in range(len(s)):
        x = int(s[i])
        for y in range(10):
            if x!=y:
                current = matrix[y][x][0]
                if(current==y):
                    matrix[y][x][0] = x
                    matrix[y][x][1] +=1

                    if(matrix[y][x][1]>max):
                        max=matrix[y][x][1]


                current = matrix[x][y][0]
                if(current==y or current==-1):
                    matrix[x][y][0] = x

                    if(matrix[x][y][1]>max):
                        max=matrix[x][y][1]
    return max*2


def calc(s):
    positions = [0,0,0,0,0,0,0,0,0,0]
    for i in range(len(s)):
        c = int(s[i])
        positions[c]+=1
    m = max(positions)
    combinations = []
    for i in range(10):
        for j in range(10):
            l1 = positions[i]
            l2 = positions[j]
            if(l1+l2>m and i!=j):
                combinations.append((i,j))
    t = test(s,combinations)
    return m if m>t else t

n = int(input())
for t in range(n):
    s = input()

    print(len(s)-calc(s))
