#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long int
#define ld long double
#define all(x) x.begin(), x.end()
#define sortall(x) sort(all(x))
#define endl '\n'
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
template<class T>
void printC (T Collection)
{
    for (auto&i:Collection)
        cout << i << " ";
}

/*
 * Think twice, code once
 * Think of different approaches to tackle a problem: write them down.
 * Think of different views of the problem. don't look from only one side.
 * don't get stuck in one approach.
 * common mistakes: - over_flow
 *                  - out_of_bound index
 *                  - infinite loop
 *                  - corner cases
 *                  - duplication counting.
*/

void solve()
{
    int n; cin >> n;
    int cnt = 0;
    vector<int> ans;
    for (int i = 1; i <= n; ++i)
    {
        char c; cin >> c;
        if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u')
        {
            cnt++;
            ans.push_back(i);
        }
    }
    cout << cnt << '\n';
    printC(ans);
}

int32_t main()
{
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    freopen("Errors.txt", "w", stderr);
#endif
    fast
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
        if (t) cout << '\n';
    }
    cout << '\n';
    return 0;
}