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