//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
map<char,bool> Mp;
int dp[1001000][3];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	Mp['A']=Mp['E']=Mp['I']=Mp['O']=Mp['U']=Mp['Y']=1;
	memset(dp,0x3f,sizeof(dp));
	dp[0][0]=0;
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		string s;
		cin>>s;
		for(int j=1;j<=3&&j<=sz(s);j++)
		{
			int pre=0;
			while(pre<j&&!Mp[s[pre]])
				pre++;
			int lst=j;
			while(lst&&!Mp[s[lst-1]])
				lst--;
			for(int a=0;a<3;a++)
				if(a+pre<3)
					dp[i][(lst?j-lst:j+a)]=min(dp[i][(lst?j-lst:j+a)],dp[i-1][a]+j);
		}
	}
	int ans=min({dp[n][0],dp[n][1],dp[n][2]});
	if(ans==0x3f3f3f3f)
		cout<<"*";
	else
		cout<<ans;
	return 0;
}