#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


const string VOWELS = "AEIOUY";
constexpr int INF = 1001001001;

char buf[2'000'010];

int N;
vector<string> S;

int main() {
  for (; ~scanf("%d", &N); ) {
    S.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%s", buf);
      S[i] = buf;
    }
    
    int crt[3];
    fill(crt, crt + 3, INF);
    crt[0] = 0;
    for (int i = 0; i < N; ++i) {
      int nxt[3] = {};
      fill(nxt, nxt + 3, INF);
      for (int k = 1; k <= 3 && k <= (int)S[i].size(); ++k) {
        for (int u = 0; u < 3; ++u) {
          int v = u;
          for (int j = 0; j < k; ++j) {
            if (~VOWELS.find(S[i][j])) {
              v = 0;
            } else {
              ++v;
              if (v >= 3) break;
            }
          }
          if (v < 3) {
            chmin(nxt[v], crt[u] + k);
          }
        }
      }
      copy(nxt, nxt + 3, crt);
    }
    const int ans = *min_element(crt, crt + 3);
    if (ans < INF) {
      printf("%d\n", ans);
    } else {
      puts("*");
    }
  }
  return 0;
}