#include <bits/stdc++.h>

using namespace std;

#define FASTIO ios::sync_with_stdio(false); cin.tie(0)

#define PB push_back

#define SZ 200005

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

#define endl '\n'

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pil> vpil;
typedef vector<pli> vpli;
typedef vector<pll> vpll;
typedef vector<vi> vvi;
typedef vector<bool> vbl;
typedef vector<string> vst;

// ordered_set
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
// template<class T> using ordered_set =tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T> using ordered_multiset =tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;

/* debugger begin */
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T, typename V, typename Z>
void __print(const tuple<T, V, Z> &x) {cerr << '{'; __print(get<0>(x)); cerr << ','; __print(get<1>(x)); cerr << ','; __print(get<2>(x)); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i : x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}

void err(istream_iterator<string> it) {
    cerr << '\n';
}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
    cerr << *it << "=";
    __print(a);
    cerr << ' ';
    err(++it, args...);
}

/* debugger end */

//const ll MOD = 1000000007;

int n;
vvi dp;
vector<string> vs;
int mark[100];

const int INF = (1<<30);

void pre() {
    string s = "AEIOUY";
    for (int i = 0; i < 6; ++i) {
        mark[s[i]] = 1;
    }
}

int dp_func(int pos, int len) {
    if (pos > n) {
        return 0;
    }
    if (dp[pos][len] != -1) return dp[pos][len];
    int ret = INF;
    {
        // prefix length 1
        int ret2 = INF;
        if (mark[vs[pos][0]]) {
            ret2 = dp_func(pos+1, 0);
        }
        else if (len < 2) {
            ret2 = dp_func(pos+1, len+1);
        }
        ret = min(ret, ret2 + 1);
    }
    if ((int)vs[pos].size() >= 2) {
        // prefix length 2
        int ret2 = INF;
        if (mark[vs[pos][0]]) {
            if (mark[vs[pos][1]]) {
                ret2 = dp_func(pos+1, 0);
            }
            else {
                ret2 = dp_func(pos+1, 1);
            }
        }
        else if (len < 2) {
            if (mark[vs[pos][1]]) {
                ret2 = dp_func(pos+1, 0);
            }
            else if (len < 1) {
                ret2 = dp_func(pos+1, len+2);
            }
        }
        ret = min(ret, ret2 + 2);
    }
    if ((int)vs[pos].size() >= 3) {
        // prefix length 3
        int ret2 = INF;
        if (mark[vs[pos][0]]) {
            if (mark[vs[pos][1]]) {
                if (mark[vs[pos][2]]) {
                    ret2 = dp_func(pos+1, 0);
                }
                else {
                    ret2 = dp_func(pos+1, 1);
                }
            }
            else {
                if (mark[vs[pos][2]]) {
                    ret2 = dp_func(pos+1, 0);
                }
                else {
                    ret2 = dp_func(pos+1, 2);
                }
            }
        }
        else if (len < 2) {
            if (mark[vs[pos][1]]) {
                if (mark[vs[pos][2]]) {
                    ret2 = dp_func(pos+1, 0);
                }
                else {
                    ret2 = dp_func(pos+1, 1);
                }
            }
            else if (len < 1) {
                if (mark[vs[pos][2]]) {
                    ret2 = dp_func(pos+1, 0);
                }
            }
        }
        ret = min(ret, ret2 + 3);
    }
    return dp[pos][len] = ret;
}

void solve(int tt) {
    cin >> n;
    dp = vvi(n+1, vi(3, -1));
    vs = vector<string>(n+1);
    for (int i = 1; i <= n; ++i) {
        cin >> vs[i];
        if ((int)vs[i].size() > 3) vs[i] = vs[i].substr(0, 3);
    }
    int ans = dp_func(1, 0);
    if (ans < n || ans >= INF) {
        cout << "*" << endl;
    }
    else {
        cout << ans << endl;
    }
}

int main() {
    FASTIO;
    pre();
    int tc = 1;
    // cin >> tc;
    for (int tt = 1; tt <= tc; tt++)
    {
        solve(tt);
    }
    return 0;
}

/*



*/