#include<bits/stdc++.h>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#define ll long long
#define int long long
using namespace std;
using namespace __gnu_pbds;

inline void down(int &a,const int &b){ if(a==-1 || a>b)a=b; }
const int maxn = 1000010;

int n;
int a[maxn][4],len[maxn];
int f[maxn][3];

signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	//mt19937 mt( (unsigned long long)(new char) );
	
	cin>>n;
	memset(f,-1,sizeof f);
	f[0][0]=0;
	for(int i=1;i<=n;i++)
	{
		string str; cin>>str;
		len[i]=min(3ll,(int)str.size());
		int fir=3;
		for(int j=0;j<len[i];j++)
		{
			if(str[j]=='A'||str[j]=='E'||str[j]=='I'||str[j]=='O'||str[j]=='U'||str[j]=='Y')
				a[i][j]=1,fir=min(fir,j);
			else a[i][j]=0;
		}
		
		for(int j=0;j<=2;j++) if(f[i-1][j]!=-1) for(int k=0;k<len[i];k++)
		{
			if(min(fir,k+1)+j<=2)
			{
				int num=0;
				for(int l=k;l>=0;l--) 
				{
					if(a[i][l]==0) num++;
					else break;
				}
				down(f[i][ k<fir ? j+k+1 : num ], f[i-1][j]+k+1);
			}
		}
	}
	int ans=-1;
	for(int j=0;j<3;j++) if(f[n][j]!=-1) down(ans,f[n][j]);
	
	if(ans==-1) cout<<"*\n";
	else cout<<ans<<endl;
	
	return 0;
}