#include <bits/stdc++.h>

using namespace std;

#define int long long
#define pb push_back
#define mp make_pair
#define pi pair<int,int>
#define f first
#define s second
#define lep(i,a,b) for (int i=(a); i <= (b); i++)
#define rep(i,b,a) for (int i = (b); i >= (a); i--)

int N;
const int inf = 1e18;
vector<char> vowels;

bool checkV(char ch) {
    return find(vowels.begin(), vowels.end(), ch) != vowels.end();
}

bool checkC(char ch) {
    return !checkV(ch);
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> N;
    vector<string> S(N);
    for (int i = 0; i < N; ++i) cin >> S[i];
    vector<vector<int>> dp(N, vector<int>(3, inf));
    vowels = {'A', 'E', 'I', 'O', 'U', 'Y'};
    for (int i = 0; i < S[0].size(); ++i) {
        // cerr << S[0][i] << " " << checkV(S[0][i]);
        if (checkV(S[0][i])) {
            dp[0][0] = i + 1;
            break;
        }
    }
    for (int i = 0; i < S[0].size(); ++i) {
        if (checkC(S[0][i])) {
            dp[0][1] = i + 1;
            break;
        }
    }
    for (int i = 1; i < S[0].size(); ++i) {
        if (checkC(S[0][i]) && checkC(S[0][i - 1])) {
            dp[0][2] = i + 1;
            break;
        }
    }
    for (int i = 1; i < N; ++i) {
        int cnt = 0;
        for (int j = 0; j < S[i].size(); ++j) {
            if (cnt > 2) break;
            if (checkV(S[i][j])) {
                if (cnt == 0) 
                    dp[i][0] = min(dp[i - 1][0], min(dp[i - 1][1], dp[i - 1][2])) + j + 1;
                else if (cnt == 1)
                    dp[i][0] = min(dp[i - 1][0], dp[i - 1][1]) + j + 1;
                else dp[i][0] = dp[i - 1][0] + j + 1;
                break;
            } else cnt++;
        }
        // for (int j = 0; j < S[i].size(); ++j) {
        //     if (checkC(S[i][j])) {
        //         dp[i][1] = dp[i - 1][0] + i + 1;
        //         break;
        //     }
        // }
        // for (int j = 1; j < S[i].size(); ++j) {
        //     if (checkC(S[i][j]) && checkC(S[i][j - 1])) {
        //         dp[i][2] = min(dp[i - 1][0], min(dp[i - 1][1], dp[i - 1][2])) + i + 1;
        //         break;
        //     }
        // }
        if (checkC(S[i][0])) {
            dp[i][1] = dp[i - 1][0] + 1;
            dp[i][2] = dp[i - 1][1] + 1;
            if (S[i].size() > 1) {
                if (checkC(S[i][1]))
                    dp[i][2] = min(dp[i][2], dp[i - 1][0] + 2);
            } 
        }
    }
    // for (int i = 0; i < N; ++i) {
    //     for (int j = 0; j <= 2; ++j) cerr << dp[i][j] << " ";
    //     cerr << endl;
    // }
    int ans = min(dp[N - 1][0], min(dp[N - 1][1], dp[N - 1][2]));
    if (ans >= inf) cout << "*";
    else cout << ans;
}
/*
3
KNUTH
MORRIS
PRATT
3 1 2 
1000000000000000000 2 2 
1000000000000000000 3 3 

3
KNUTH
M
PRATT
3 1 2 
1000000000000000000 2 1000000000000000000 
1000000000000000000 3 3 

3
K
M
P
1000000000000000000 1 1000000000000000000 
1000000000000000000 2 1000000000000000000 
1000000000000000000 3 1000000000000000000 

2
K
M
1000000000000000000 1 1000000000000000000 
1000000000000000000 2 1000000000000000000 

4
YOU
SHOULD
BE
DANCING
2 1 1000000000000000000 
1000000000000000000 2 2 
1000000000000000000 3 3 
1000000000000000000 4 4 
*/