#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<string>
#include<cstring>
#include<map>
using namespace std;
typedef long long ll;
const int maxn=100010;
int main()
{
	char zz[110];
	int t;
	scanf("%d",&t);
	getchar();
	while(t--)
	{
		int ans=0;
		scanf("%s",zz);
		int l=strlen(zz);
		for(int i=0;i<l;i++)
		{
			if(zz[i]=='a') ans++;
			if(zz[i]=='e') ans++; 
			if(zz[i]=='i') ans++; 
			if(zz[i]=='u') ans++; 
			if(zz[i]=='o') ans++;  
			
		}
		printf("%d\n",ans);
	}
	return 0;
}