#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<string>
#include<cstring>
#include<map>
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;
const int maxn=100000;
typedef long long ll;
int main(){
	int n;
	scanf("%d",&n);
	while(n--){
		char s[60];
		scanf("%s",s);
		int len=strlen(s);
		int sum=0;
		for(int i=0;i<len;i++){
			if(s[i]=='a'||s[i]=='e'||s[i]=='i'||s[i]=='o'||s[i]=='u')
				sum++;
		}
		printf("%d\n",sum);
	}
	return 0;
}