#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5; 
const int INF = 1e9; 

int n; 
int f[N][3][3]; // 考虑到第 i 个字符串，选取 i 个，剩余 j 个辅音
string s[N]; 

inline bool check(char x) {
    if (x == 'A' || x == 'E' || x == 'I' || x == 'O' || x == 'U' || x == 'Y') return 1; 
    return 0; 
}
inline void ckmin(int &x, int t) { x = (x > t ? t : x); }

int main(void) {
    ios::sync_with_stdio(0); 
    memset(f, 0x3f, sizeof f); 
    cin >> n; 
    for (int i = 1; i <= n; ++i) cin >> s[i]; 
    for (int i = 0; i < 3; ++i) for (int j = 0; j < 3; ++j) f[0][i][j] = 0; 
    
    for (int i = 1; i <= n; ++i) for (int j = 0; j < 3; ++j) {
        for (int x = 0; x < 3; ++x) for (int y = 0; y < 3; ++y) if (f[i - 1][x][y] < INF) {
            // 当前是合法的吗？
            int now = y, flg = 1; 
            for (int p = 0; p <= j; ++p) 
                if (check(s[i][p])) now = 2; 
                else {
                    --now; 
                    if (now < 0) { flg = 0; break; }
                }
            if (flg) {
                for (int p = 0; p <= now; ++p)
                    ckmin(f[i][j][p], f[i - 1][x][y] + (j + 1)); 
            }
        }
    }
    
    int ans = INF; 
    for (int i = 0; i < 3; ++i) for (int j = 0; j < 3; ++j) ans = min(ans, f[n][i][j]); 
    if (ans == INF) cout << "*\n"; 
    else cout << ans << "\n"; 
    return 0;
}