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.
t=int(input())
while t:
	t-=1
	s=input()
	if len(list(set(s)))==1:
		print("0")
	else:
#		x=['00', '01', '02', '03', '04', '05', '06', '07', '08', '09', '11', '12', '13', '14', '15', '16', '17', '18', '19', '22', '23', '24', '25', '26', '27', '28', '29', '33', '34', '35', '36', '37', '38', '39', '44', '45', '46', '47', '48', '49', '55', '56', '57', '58', '59', '66', '67', '68', '69', '77', '78', '79', '88', '89', '99']
		x=['00', '01', '02', '03', '04', '05', '06', '07', '08', '09', '10', '11', '12', '13', '14', '15', '16', '17', '18', '19', '20', '21', '22', '23', '24', '25', '26', '27', '28', '29', '30', '31', '32', '33', '34', '35', '36', '37', '38', '39', '40', '41', '42', '43', '44', '45', '46', '47', '48', '49', '50', '51', '52', '53', '54', '55', '56', '57', '58', '59', '60', '61', '62', '63', '64', '65', '66', '67', '68', '69', '70', '71', '72', '73', '74', '75', '76', '77', '78', '79', '80', '81', '82', '83', '84', '85', '86', '87', '88', '89', '90', '91', '92', '93', '94', '95', '96', '97', '98', '99']
		l=len(x)
		y=[0]*l
#		z=[0]*len(x)
#		w=[1]*len(x)
		extra=[0]*10
		ans=[0]*l
		for i in range(len(s)):
			extra[int(s[i])]+=1
			for j in range(l):
				if s[i]==x[j][y[j]%2]:
					y[j]+=1
					if y[j]%2==0:
						ans[j]+=1
#				if s[i]==x[j][(w[j]%2)]:
#					w[j]+=1
#					if w[j]%2==1:
#						z[j]+=1
	#		print(y)
#		print(extra)
#	print(ans)
#	print(ans)
#	print(z)
#		m=max(max(ans),max(z))
#		print(len(s)-max(2*m,max(extra)))
#		print(ans)
#		print(len(s),max(ans),max(extra))
#		s=sorted(s)
#		print(s)
#		print(extra)
		print(len(s)-max(2*max(ans),max(extra)))
