#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int n, f[N][3], len[N];
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    string s;
    for (int i = 1; i <= n; ++i) {
        cin >> s;
        len[i] = 1e9;
        for (int j = 0; j < s.size(); ++j) {
            if (s[j] != 'A' && s[j] != 'E' && s[j] != 'I' && s[j] != 'O' && s[j] != 'U' && s[j] != 'Y') continue;
            len[i] = j + 1;
            break;
        }
    }
    for (int i = 1; i <= n; ++i) {
        f[i][0] = 1e9;
        if (len[i] <= 3) {
            for (int d = 0; d + len[i] - 1 <= 2; ++d) f[i][0] = min(f[i][0], f[i - 1][d] + len[i]);
        }
        f[i][1] = f[i - 1][0] + 1;
        f[i][2] = f[i - 1][1] + 1;
    }
    int ans = min({f[n][0], f[n][1], f[n][2]});
    if (ans >= 1e9) cout << "*" << endl;
    else cout << ans << endl;
    return 0;
}