#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<map>
using namespace std;
#define maxn 100100
#define ll long long
#define mm(a,b) memset(a,b,sizeof(a))

int n;
char s[maxn];
map<char,int>m;
void init(){
	m['a']=1;
	m['e']=1;
	m['i']=1;
	m['o']=1;
	m['u']=1;
}
int main(){
	cin>>n;
	int ans;
	init();
	while(n--){
		scanf("%s",s);
		ans=0;
		for(int i=0;i<strlen(s);i++)
		{
			if(m.count(s[i])) ans++;
		}
		printf("%d\n",ans);
	}
}