#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int n,f[2000005][4];
char s[2000005];
inline bool is_vowel(char x){ return x == 'A' || x == 'E' || x == 'I' || x == 'O' || x == 'U' || x == 'Y'; }

void solve(){
    scanf("%d",&n);
    memset(f,0x3f,sizeof(f));
    f[0][0] = 0;
    for(int i = 1;i <= n;i ++){
        scanf("%s",s + 1);
        int len = strlen(s + 1);
        for(int cur = 1;cur <= min(3,len);cur ++){ // selected length
            for(int las = 0;las < 3;las ++){
                int pre = 0;
                for(int j = 1;j <= cur;j ++){
                    if(!is_vowel(s[j])) pre ++;
                    else break;
                }
                if(pre + las > 2) continue;
                int suf = 0;
                for(int j = cur;j >= 1;j --){
                    if(!is_vowel(s[j])) suf ++;
                    else break;
                }
                int conc = suf;
                if(suf == cur) conc = cur + las;
                f[i][conc] = min(f[i][conc],f[i - 1][las] + cur);
            }
        }
    }
    int ans = min({f[n][0],f[n][1],f[n][2]});
    if(ans == 0x3f3f3f3f) printf("*\n");
    else printf("%d\n",ans);
}

int main(){
    solve();
    return 0;
}