#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

vector<char> vovel = {'A', 'E', 'I', 'O', 'U', 'Y'};

bool vov(char h) {
    return find(vovel.begin(), vovel.end(), h) != vovel.end();
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin >> n;
    vector<string> s(n);
    for (int i = 0; i < n; ++i) cin >> s[i];

    vector<vector<int>> dp(n + 1, vector<int>(3, 1e7));
    dp[0][0] = 0;
    // vector<vector<pair<int, int>>> pr(n + 1, vector<pair<int, int>>(3, {-1, -1}));

    for (int i = 0; i < n; ++i) {
        // cnt const
        for (int w = 0; w < 3; ++w) {
            for (int u = 1; u <= min(3, (int)s[i].size()); ++u) {
                if (vov(s[i][u-1])) {
                    if (w + u - 1 <= 2) {
                        if (dp[i + 1][0] > dp[i][w] + u) {
                            dp[i + 1][0] = dp[i][w] + u;
                            // pr[i + 1][0] = {u, w};
                        }
                    }
                    break;
                } else {
                    if (w + u <= 2) {
                        if (dp[i + 1][w + u] > dp[i][w] + u) {
                            dp[i + 1][w + u] = dp[i][w] + u;
                            // pr[i + 1][w + u] = {u, w};
                        }
                    }
                }
            }
        }
    }
    int wres = 0;
    for (int w = 0; w < 3; ++w) {
        if (dp[n][w] < dp[n][wres]) wres = w;
    }
    int res = dp[n][wres];
    if (res >= 5e6) {
        cout << "*\n";
        return 0;
    }

    cout << res << '\n';

    
    return 0;
}