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

#define endl "\n"
#define F first
#define S second
#define pii pair<int, int>
#define sz(x) (int) (x.size())

string tmp = "aeiou";


const int N = 2e5 + 10;
const int mod = 1e9 + 7;
const int INF = 1e18 + 10;

int n;
string s;
vector<vector<vector<int>>> dp;

int mp(char ch) {
    if(ch == 'a') return 0;
    if(ch == 'e') return 1;
    if(ch == 'i') return 2;
    if(ch == 'o') return 3;
    if(ch == 'u') return 4;
    else assert(false);
}

int magic(int ind, int mask, int prv) {
    if(ind == -1) {
        return 0;
    }

    int &ans = dp[ind][mask][prv];
    if(~ans) return ans;
    ans = INF;

    for(int op = 0; op <= 4; op++) {
        int cur = (mp(s[ind]) + op) % 5;
        if(cur != prv && (mask & (1LL << cur))) continue;
        ans = min(ans, op + magic(ind - 1, mask | (1LL << cur), cur));
    }

    return ans;
}

void solve() {
    cin >> n >> s;
    dp = vector<vector<vector<int>>>(n, vector<vector<int>>(35, vector<int>(6, -1)));
    cout << magic(n - 1, 0, 5) << endl;
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t = 1; cin>>t;
    for(int tc = 1; tc <= t; tc++) {
        // cout<<"Case "<<tc<<":";
        solve();
    }
}