#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;

#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define F0Rd(i, a) for (int i = (a) - 1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define sz(x) (int)(x).size()
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert

const char nl = '\n';

bool isVowel(char C) {
    char vows[6] = {'A','E','I','O','U','Y'};
    F0R(i, 6) if (C == vows[i]) return true;
    return false;
}

const int MX = 1000000007;
void solve() {
    int N; cin >> N;
    int dp[N+1][3]; F0R(i, N+1) F0R(j, 3) dp[i][j] = MX;
    dp[0][0] = 0;
    F0R(i, N) {
        string S; cin >> S;
        F0R(j, 3) {
            int cur = j;
            F0R(k, sz(S)) {
                if (isVowel(S[k])) {
                    cur = 0;
                } else cur++;
                if (cur == 3) break;
                dp[i+1][cur] = min(dp[i+1][cur], dp[i][j]+k+1);
                if (cur == 0) break;
            }

        }
    }
    /*F0R(i, N+1) {
        F0R(j, 3) {
            cout << dp[i][j] << " ";
        }
        cout << nl;
    }*/

    int ans = MX;
    F0R(i, 3) ans = min(ans, dp[N][i]);
    if (ans >= MX/2) {
        cout << "*" << nl; return;
    }
    cout << ans << nl;


    
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	solve();
	return 0;
}