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

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


// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;

// template<typename T> using o_set = tree<T, null_type, std::less<T>, 
// rb_tree_tag, tree_order_statistics_node_update>;

string tmp = "aeiou";


const int N = 2e5 + 10;
const int mod = 1e9 + 7;
const int INF = 1e9 + 10;
int f(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;
    return 5;
}
string s; 
int dp[N][32][6];
int magic(int pos, int mask, int last) {
    if(pos == s.size()) return 0;
    int &ans = dp[pos][mask][last];
    if(~ans) return ans;
    ans = INT_MAX;
    for(int i = 0; i < 5; i ++) {
        if(mask >> i & 1) continue;
        int op = i - f(s[pos]);
        if(op < 0) op += 5;
        ans = min(ans, op + magic(pos + 1, mask | (1 << i), i));
    }

    if(last != 5) {
        int op = last - f(s[pos]);
        if(op < 0) op += 5;
        ans = min(ans, op + magic(pos + 1, mask, last));
    }

    return ans;
}

void solve() {
    int n; cin>>n;
    cin>>s;
    // cout<<n<<" "<<s<<endl;
    
    // vector<vector<vector<int>>> dp(n, vector<vector<int>>(32, vector<int>(6, -1)));

    

    for(int i = 0; i < n; i++)
        for(int j = 0; j < 32; j++)
            for(int k = 0; k < 6; k++)
                dp[i][j][k] = -1;


    cout<<magic(0, 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();
    }
}