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

#define ll long long int
#define nl '\n'
#define INF 1e8

string v = "aeiou";
int cost[5][5];   // Cost matrix for vowels
int id[256];      // Map vowels to indices

int n;
string st;
int dp[2][33][6]; // Reduce DP space to two layers: current and next

void answer_to_the_question() {
    cin >> n >> st;

    // Initialize DP array with INF
    for (int j = 0; j < 33; j++) {
        for (int k = 0; k < 6; k++) {
            dp[0][j][k] = dp[1][j][k] = INF;
        }
    }

    // Base case: At index 0 with empty mask and no previous vowel
    dp[0][0][0] = 0;

    for (int i = 0; i < n; i++) {
        int curr = i % 2;
        int next = 1 - curr;

        // Reset next layer
        for (int j = 0; j < 33; j++) {
            for (int k = 0; k < 6; k++) {
                dp[next][j][k] = INF;
            }
        }

        for (int mask = 0; mask < 32; mask++) {
            for (int last = 0; last < 6; last++) {
                if (dp[curr][mask][last] == INF) continue;

                // Option 1: Don't take a vowel
                int m1 = mask;
                if (!(m1 & (1 << id[st[i]]))) {
                    if (last != 0 && st[i] != v[last - 1]) {
                        m1 |= (1 << (last - 1));
                    }
                    dp[next][m1][id[st[i]] + 1] = min(dp[next][m1][id[st[i]] + 1], dp[curr][mask][last]);
                }

                // Option 2: Replace with a vowel
                for (int c = 0; c < 5; c++) {
                    int m2 = mask;
                    if (!(m2 & (1 << c))) {
                        if (last != 0 && v[c] != v[last - 1]) {
                            m2 |= (1 << (last - 1));
                        }
                        dp[next][m2][c + 1] = min(dp[next][m2][c + 1], dp[curr][mask][last] + cost[id[st[i]]][c]);
                    }
                }
            }
        }
    }

    // Final result
    int result = INF;
    for (int mask = 0; mask < 32; mask++) {
        for (int last = 0; last < 6; last++) {
            result = min(result, dp[n % 2][mask][last]);
        }
    }

    cout << result << nl;
}

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int test_case;
    cin >> test_case;

    // Precompute costs and ID mappings
    for (int i = 0; i < 5; i++) {
        for (int j = 0; j < 5; j++) {
            cost[i][j] = (10 + j - i) % 5;
        }
    }
    for (int i = 0; i < 5; i++) {
        id[v[i]] = i;
    }

    // Process each test case
    while (test_case--) {
        answer_to_the_question();
    }

    return 0;
}