Chef has a string of size $N$ which consists only lowercase English alphabet. The chef doesn't like the consonant alphabet at all. So he is thinking of changing every single consonant alphabet to any vowel alphabet. There is some cost for performing this operation.
- Number all alphabet [a,b,c,……,z] as [1,2,3,…..,26]
- So if you want to change c to e then cost will be |e-c| = |5-3| = 2
You need the answer at what minimum cost chef can change every single consonant alphabet to any vowel alphabet. 

-----Input:-----
- First-line will contain $T$, the number of test cases. Then the test cases follow. 
- Each test case contains of a single line of input, a string of lowercase alphabet. 

-----Output:-----
For each test case, output in a single line answer.

-----Constraints-----
- $1 \leq T \leq 100$
- $1 \leq |s| \leq 10^2$

-----Sample Input:-----
2
aeiou
dbcc  

-----Sample Output:-----
0
6

-----EXPLANATION:-----
In the first test case, all characters are already vowel so we don't need to change.
In the second tect case
|e-d|=|5-4|=1
|a-b|=|1-2|=1
|a-c|=|1-3|=2
|a-c|=|1-3|=2
1+1+2+2=6

Difficulty: UNKNOWN_DIFFICULTY

Starter code:

Solutions:
str1 = int(input())
for i in range(str1):
	l1 = []
	str2 = input()
	for i in str2:
		l1.append(i)
	count = 0
	d = dict()
	d = {'a': 1, 'b': 2, 'c': 3, 'd': 4, 'e': 5, 'f': 6, 'g': 7, 'h': 8, 'i': 9, 'j': 10, 'k': 11, 'l': 12, 'm': 13, 'n': 14}
	d1 = {'o': 15, 'p': 16, 'q': 17, 'r': 18, 's': 19, 't': 20, 'u': 21, 'v': 22, 'w': 23, 'x': 24, 'y': 25, 'z': 26}
	d.update(d1)
	for j in l1:
		if j not in ['a', 'e', 'i', 'o', 'u']:
			a = abs(d[j] - d['a'])
			e = abs(d[j] - d['e'])
			i = abs(d[j] - d['i'])
			o = abs(d[j] - d['o'])
			u = abs(d[j] - d['u'])
			count += min([a, e, i, o, u])
	print(count)


t = int(input())
while t > 0:
	s = input()
	a = [1, 5, 9, 15, 21]
	b = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
	k = []
	for i in range(len(s)):
		for j in range(len(b)):
			if s[i] == b[j]:
				k.append(j + 1)
				break
	c = []
	for i in range(len(k)):
		min = 10000
		for j in range(len(a)):
			p = abs(k[i] - a[j])
			if p <= min:
				min = p
		c.append(min)
	s = 0
	for i in range(len(c)):
		s = s + c[i]
	print(s)
	t -= 1


vowel = 'aeiou'
t = int(input())
for _ in range(t):
	cnt = 0
	n = input()
	for each in n:
		if each in vowel:
			continue
		else:
			x = abs(ord(each) - 96 - 1)
			y = abs(ord(each) - 96 - 5)
			w = abs(ord(each) - 96 - 9)
			z = abs(ord(each) - 96 - 15)
			a = abs(ord(each) - 96 - 21)
			cnt += min(x, y, w, z, a)
	print(cnt)


try:
	for _ in range(int(input())):
		s = input()
		cost = 0
		for i in range(len(s)):
			if s[i] not in 'aeiou':
				n = ord(s[i]) - 96
				cost += min(abs(n - 1), abs(n - 5), abs(n - 9), abs(n - 15), abs(n - 21))
		print(cost)
except:
	pass


for _ in range(int(input())):
	inp = input()
	count = 0
	for i in inp:
		if i != 'a' or i != 'e' or i != 'i' or (i != 'o') or (i != 'u'):
			if i == 'b' or i == 'd' or i == 'f' or (i == 'h') or (i == 'j') or (i == 'n') or (i == 'p') or (i == 't') or (i == 'v'):
				count += 1
			if i == 'c' or i == 'g' or i == 'k' or (i == 'm') or (i == 'q') or (i == 's') or (i == 'w'):
				count += 2
			if i == 'l' or i == 'r' or i == 'x':
				count += 3
			if i == 'y':
				count += 4
			if i == 'z':
				count += 5
	print(count)


st = 'Aabcdefghijklmnopqrstuvwxyz'
li = list(st)
l1 = ['b', 'c']
l2 = ['d', 'f', 'g']
l3 = ['h', 'j', 'k', 'l']
l4 = ['m', 'n', 'p', 'q', 'r']
l5 = ['s', 't', 'v', 'w', 'x', 'y', 'z']
t = int(input())
for _ in range(t):
	s = input()
	su = 0
	for i in range(len(s)):
		if s[i] == 'a' or s[i] == 'e' or s[i] == 'i' or (s[i] == 'o') or (s[i] == 'u'):
			su += 0
		else:
			if s[i] in l1:
				su = su + abs(1 - li.index(s[i]))
			if s[i] in l2:
				su = su + abs(5 - li.index(s[i]))
			if s[i] in l3:
				su = su + abs(9 - li.index(s[i]))
			if s[i] in l4:
				su = su + abs(15 - li.index(s[i]))
			if s[i] in l5:
				su = su + abs(21 - li.index(s[i]))
	print(su)


y = [1, 5, 9, 15, 21]
for i in range(int(input())):
	s = 0
	x = input()
	for j in x:
		mn = 26
		for k in y:
			z = abs(k - (ord(j) - 96))
			if z < mn:
				mn = z
		s += mn
	print(s)


def chef(a):
	b = []
	c = 0
	b = [ord('a'), ord('e'), ord('i'), ord('o'), ord('u')]
	for i in range(len(a)):
		if ord(a[i]) in b:
			continue
		else:
			c += int(chef2(a[i], b))
	return c

def chef2(a, b):
	c = []
	for i in b:
		c.append(abs(ord(a) - i))
	return min(c)
T = int(input())
for _ in range(T):
	a = input()
	print(chef(a))


alp = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
vo = ['a', 'e', 'i', 'o', 'u']
con = []
for i in alp:
	if i not in vo:
		con.append(i)
for _ in range(int(input())):
	sm = 0
	uin = input().strip()
	for i in uin:
		if i in vo:
			continue
		else:
			mn = 100
			for j in vo:
				if abs(alp.index(i) + 1 - (alp.index(j) + 1)) < mn:
					mn = abs(alp.index(i) + 1 - (alp.index(j) + 1))
			sm = sm + mn
	print(sm)


for _ in range(int(input())):
	s = input()
	sm = 0
	for i in range(len(s)):
		if s[i] != 'a' and s[i] != 'e' and (s[i] != 'i') and (s[i] != 'o') and (s[i] != 'u'):
			if ord(s[i]) - 96 <= 3:
				sm += abs(ord(s[i]) - 97)
			elif ord(s[i]) - 96 <= 7 and ord(s[i]) - 96 > 3:
				sm += abs(ord(s[i]) - ord('e'))
			elif ord(s[i]) - 96 <= 12 and ord(s[i]) - 96 > 7:
				sm += abs(ord(s[i]) - ord('i'))
			elif ord(s[i]) - 96 <= 18 and ord(s[i]) - 96 > 12:
				sm += abs(ord(s[i]) - ord('o'))
			else:
				sm += abs(ord(s[i]) - ord('u'))
	print(sm)


for i in range(int(input())):
	a = input()
	g = 0
	for i in a:
		p = ord(i) % 96
		if p <= 3:
			g += abs(p - 1)
		elif 4 <= p <= 6:
			g += abs(p - 5)
		elif 7 <= p <= 12:
			g += abs(p - 9)
		elif 13 <= p <= 18:
			g += abs(p - 15)
		else:
			g += abs(p - 21)
	print(g)


def isVowel(char):
	return char in 'aeiou'
n = int(input())
for _ in range(n):
	s = input()
	p = 0
	q = 0
	for i in s:
		if isVowel(i):
			p = p + 1
		elif i > 'a' and i < 'e':
			if i == 'c':
				q = q + 2
			else:
				q = q + 1
		elif i > 'e' and i < 'i':
			if i == 'g':
				q = q + 2
			else:
				q = q + 1
		elif i > 'i' and i < 'o':
			if i == 'l':
				q = q + 3
			elif i == 'k' or i == 'm':
				q = q + 2
			else:
				q = q + 1
		elif i > 'o' and i < 'u':
			if i == 'r':
				q = q + 3
			elif i == 'q' or i == 's':
				q = q + 2
			else:
				q = q + 1
		elif i > 'u':
			if i == 'x':
				q = q + 3
			elif i == 'y':
				q = q + 4
			elif i == 'z':
				q = q + 5
			elif i == 'w':
				q = q + 2
			else:
				q = q + 1
		else:
			p = p + 1
	print(q)


t = int(input())
v = [1, 5, 9, 15, 21]
s = {'a': 1, 'b': 2, 'c': 3, 'd': 4, 'e': 5, 'f': 6, 'g': 7, 'h': 8, 'i': 9, 'j': 10, 'k': 11, 'l': 12, 'm': 13, 'n': 14, 'o': 15, 'p': 16, 'q': 17, 'r': 18, 's': 19, 't': 20, 'u': 21, 'v': 22, 'w': 23, 'x': 24, 'y': 25, 'z': 26}
for i in range(t):
	x = input()
	l = list(x)
	d = []
	for j in range(len(x)):
		a = s.get(l[j])
		m = []
		for k in range(5):
			x = abs(a - v[k])
			m.append(x)
		d.append(min(m))
	print(sum(d))


for i in range(int(input())):
	a = input()
	cnt = 0
	for i in a:
		if i == 'a' or i == 'e' or i == 'i' or (i == 'o') or (i == 'u'):
			cnt = cnt + 0
		elif i == 'b' or i == 'f' or i == 'j' or (i == 'd') or (i == 'h') or (i == 'n') or (i == 'p') or (i == 't') or (i == 'v'):
			cnt = cnt + 1
		elif i == 'c' or i == 'g' or i == 'k' or (i == 'm') or (i == 'q') or (i == 's') or (i == 'w'):
			cnt = cnt + 2
		elif i == 'l' or i == 'r' or i == 'x':
			cnt = cnt + 3
		elif i == 'y':
			cnt = cnt + 4
		else:
			cnt = cnt + 5
	print(cnt)


try:
	t = int(input())
	while t > 0:
		t -= 1
		su = 0
		s = input()
		a = ['a', 'e', 'i', 'o', 'u']
		for i in range(len(s)):
			if s[i].isalpha():
				if s[i] in a:
					continue
				minn = 26
				for j in range(5):
					tem = abs(ord(a[j]) - ord(s[i]))
					if tem < minn:
						minn = tem
				su += minn
		print(su)
except:
	pass


l = [1, 5, 9, 15, 21]
import bisect
for i in range(int(input())):
	s = input()
	sum = 0
	for k in s:
		x = ord(k) - ord('a') + 1
		y = bisect.bisect(l, x)
		if y == 0:
			sum += l[0] - x
		elif y == 5:
			sum += x - l[4]
		else:
			sum += min(x - l[y - 1], l[y] - x)
	print(sum)


try:
	t = int(input())
	for _ in range(t):
		s = input()
		a = 'aeiou'
		ar = [1, 5, 9, 15, 21]
		c = 0
		for i in s:
			if i not in a:
				x = ord(i) - 96
				if x >= 18:
					c += abs(x - 21)
				elif x >= 12:
					c += abs(x - 15)
				elif x >= 7:
					c += abs(x - 9)
				elif x >= 3:
					c += abs(x - 5)
				else:
					c += abs(x - 1)
		print(c)
except EOFError:
	pass


try:
	T = int(input())
	for i in range(T):
		s = input()
		w = [1, 5, 9, 15, 21]
		l = ['a', 'e', 'i', '0', 'u']
		cnt = 0
		for j in range(len(s)):
			if s[j] not in l:
				cnt = cnt + min(abs(ord(s[j]) - 96 - w[0]), abs(ord(s[j]) - 96 - w[1]), abs(ord(s[j]) - 96 - w[2]), abs(ord(s[j]) - 96 - w[3]), abs(ord(s[j]) - 96 - w[4]))
		print(cnt)
except:
	pass


t = int(input())
vowels = ['a', 'e', 'i', 'o', 'u']
for i in range(t):
	s = input()
	sum = 0
	for j1 in s:
		if j1 in vowels:
			continue
		else:
			l = []
			for k1 in vowels:
				if ord(k1) - 96 >= ord(j1) - 96:
					diff = ord(k1) - 96 - (ord(j1) - 96)
				else:
					diff = ord(j1) - 96 - (ord(k1) - 96)
				l.append(diff)
			minimum = min(l)
			sum = sum + minimum
	print(sum)


import math
alpha = 'abcdefghijklmnopqrstuvwxyz'
vow = 'aeiou'
for t_itr in range(int(input())):
	s = str(input())
	count = 0
	for i in s:
		if i in vow:
			count += 0
		else:
			a = []
			a.append(abs(alpha.index(i) - alpha.index('a')))
			a.append(abs(alpha.index(i) - alpha.index('e')))
			a.append(abs(alpha.index(i) - alpha.index('i')))
			a.append(abs(alpha.index(i) - alpha.index('o')))
			a.append(abs(alpha.index(i) - alpha.index('u')))
			count += min(a)
	print(count)


t = int(input())
for i in range(t):
	a = input()
	b = list()
	sum = 0
	for i in a:
		d = ord(i) - 96
		b.append(d)
	for i in b:
		z = []
		d = [1, 5, 9, 15, 21]
		if i not in d:
			for p in d:
				x = abs(i - p)
				z.append(x)
			sum = sum + min(z)
	print(sum)


t = int(input())
for i in range(t):
	s = input()
	a = 'aeiou'
	cnt = 0
	for i in range(len(s)):
		x = s[i]
		arr = []
		for j in range(5):
			z = abs(ord(x) - ord(a[j]))
			arr.append(z)
		cnt += min(arr)
	print(cnt)