#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define all(x) x.begin(), x.end()
#define pb push_back
#define f first
#define s second

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    if (fopen("input.in", "r")) {
        freopen("input.in", "r", stdin);
        freopen("output.out", "w", stdout);
    }
    int n; cin>>n;
    vector<string> ar;
    for(int i=0; i<n; i++) {
        string s; cin>>s;
        ar.pb(s);
    }
    int cost[n][3];
    for(int i=0; i<n; i++) cost[i][0] = cost[i][1] = cost[i][2] = 2e8;
    set<char> vowels;
    vowels.insert('A');
    vowels.insert('E');
    vowels.insert('I');
    vowels.insert('O');
    vowels.insert('U');
    vowels.insert('Y');
    for(int i=0; i<n; i++){
        int cur = 0;
        for(int j=0; j<ar[i].size(); j++){
            if(vowels.find(ar[i][j]) != vowels.end()) cur = 0;
            else cur++;
            if(cur == 1) {
                cost[i][1] = min(cost[i][1], j+1);
            }
            else if(cur == 0) {
                cost[i][0] = min(cost[i][0], j+1);
            }
            else if(cur == 2) {
                cost[i][2] = min(cost[i][0], j+1);
            }
            else break;
        }
    }
    vector<vector<int>> dp(n, vector<int>(3,2e8));
    dp[0][0] = cost[0][0];
    dp[0][1] = cost[0][1];
    dp[0][2] = cost[0][2];
    for(int i=1; i<n; i++){
        dp[i][0] = min(dp[i][0], min({dp[i-1][0], dp[i-1][1], dp[i-1][2]}) + cost[i][0]);
        dp[i][1] = min(dp[i][1], dp[i-1][0] + cost[i][1]);
        dp[i][2] = min(dp[i][2], min(dp[i-1][0] + cost[i][2], dp[i-1][1] + cost[i][1]));
    }
    int res = min({dp[n-1][0], dp[n-1][1], dp[n-1][2]});
    if(res >= 2e8) cout<<'*';
    else cout<<res;
}