#include<bits/stdc++.h>
using namespace std;
const long long mod=1e9+7;
long long T,a,b,c,d[1000001],v[1000001],o,h[1000001],fa[1000001],q,w,e,an,cn,fac[1000001],inv[1000001],st[1000001],u[1000001],dp[1000001][3],inf=1e16;
char s[1000001];
struct p{long long q,w;}l[1000001];
long long pow_(long long qq,long long ww){long long ee=1;while(ww){if(ww&1) ee*=qq,ee%=mod;qq*=qq,qq%=mod,ww>>=1;}return ee%mod;}
inline int read(){int x=0,f=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}return x*f;}
void add(long long qq,long long ww){l[++o].q=ww,l[o].w=h[qq],h[qq]=o;}
long long gcd(long long qq,long long ww){return !ww?qq:gcd(ww,qq%ww);}
long long find(long long qq){return qq==fa[qq]?qq:fa[qq]=find(fa[qq]);}
void merge(long long qq,long long ww){long long f1=find(qq),f2=find(ww);if(f1==f2) return;fa[f1]=f2;}
long long C(long long qq,long long ww){return fac[qq]*inv[ww]%mod*inv[qq-ww]%mod;}
vector<int> qu[1000001];
int main()
{
//	freopen("1.in","r",stdin);
	srand((unsigned)(time(0)^(*new int)));
	fac[0]=1;for(int i=1;i<=1000000;i++) fac[i]=fac[i-1]*i%mod;
	inv[1000000]=pow_(fac[1000000],mod-2);for(int i=999999;i>=0;i--) inv[i]=inv[i+1]*(i+1)%mod;
	scanf("%lld",&a);
	memset(dp,0x3f3f3f3f3f,sizeof(dp));
	for(int i=1;i<=a;i++)
	{
		scanf("%s",s+1);
		b=strlen(s+1);d[i]=b;
		qu[i].resize(b+2);
		for(int j=1;j<=b;j++)
		{
			if(s[j]=='A'||s[j]=='E'||s[j]=='I'||s[j]=='O'||s[j]=='U'||s[j]=='Y') qu[i][j]=0;
			else qu[i][j]=1;
		}
	}
	dp[0][0]=0;
	for(int i=1;i<=a;i++)
	{
		long long hh=0,fl=1,mx=0;
		b=d[i];
		for(int j=1;j<=b;j++)
		{
			if(qu[i][j]) ++hh;
			else hh=0,fl=0;
			if(hh==3) break;
			if(fl) mx=max(mx,hh);
			for(int k=0;k<3;k++)
			{
				if(!qu[i][j])
				{
					if(k+mx<3)
					{
						dp[i][0]=min(dp[i][0],dp[i-1][k]+j);
					}
				}
				else
				{
					if(fl&&k+hh<3)
					{
						dp[i][k+hh]=min(dp[i][k+hh],dp[i-1][k]+j);
					}
					else if(!fl&&k+mx<3)
					{
						dp[i][hh]=min(dp[i][hh],dp[i-1][k]+j);
					}
				}
			}
		}
	}
//	cout<<dp[1][1]<<" "<<dp[2][0]<<" "<<dp[2][2]<<"\n";
	an=min(dp[a][0],min(dp[a][2],dp[a][1]));
	if(an<=inf) printf("%lld",an);
	else putchar('*');
	return 0;
}