#include<bits/stdc++.h>

typedef long long ll;

using namespace std;
const int N = 1e5 + 50;


int n;
char s[N];
int to[N];

void solve() {
    cin >> n >> (s + 1);
    to[n] = n;
    for (int i = n - 1; i >= 1; i--) {
        if (s[i] == s[i + 1]) to[i] = to[i + 1];
        else to[i] = i;
    }
    for (int i = 1; i <= n; i++) {
        int p = i;
        if (to[p] == n) {
            cout << 1 << " \n"[i == n];
            continue;
        }
        while (p <= n) {
            p = to[p];
            if (p == n) break;
            if (s[i] < s[p + 1]) {
                p++;
            } else break;
        }
        cout << p - i + 1 << " \n"[i == n];
    }
}


int main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);
    int _ = 1;
    cin >> _;
    for (int o = 1; o <= _; o++) {
        solve();
    }
    return 0;
}
/*



1
5
abcbd

 */