Minimum Operations to Vowels

You are given a string s. Your task is to compute the minimum number of operations required to transform the string into a string that consists only of lowercase vowels.

In one operation, you can change any character in the string to any vowel (i.e. one of a, e, i, o, u). Formally, if the input string has length n, the number of operations required is given by \[ \text{operations} = \sum_{i=1}^{n} \mathbf{1}_{\{s_i \notin \{a, e, i, o, u\}\}} \] where \(\mathbf{1}_{\{condition\}}\) is 1 if the condition is true and 0 otherwise.

Input Format: The first line contains an integer T denoting the number of test cases. Each of the following T lines contains a string s consisting of lowercase English letters.

Output Format: For each test case, output a single integer – the minimum number of operations required to convert the string into a string of vowels. Each result should be printed on its own line.

inputFormat

The input begins with a single integer T (1 ≤ T ≤ 100), representing the number of test cases. Each test case consists of a single line containing a non-empty string s composed of lowercase English letters. Note that the string can be empty as well.

outputFormat

For each test case, output one line containing a single integer – the minimum number of operations required to change all characters in the string to vowels.

## sample

2
hello
world

3
4

</p>