#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

#define PG_Mazen ios_base::sync_with_stdio( 0 ), cin.tie( 0 ), cout.tie( 0 );
#define el '\n'
#define sp ' '
#define all(v) v.begin(), v.end()
#define r_all(v) (v).rbegin(), (v).rend()
#define SZ(v) (v).size()
#define pb(n) push_back(n)
#define eb(n, m) emplace_back(n, m)
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll,ll>
#define F first
#define S second
#define loop int t; cin >> t; for(int i=1;i<=t;++i)
#define f0(i, st, n) for(int i=st;i<n;++i)
#define f1(i, st, n) for(int i=st;i<=n;++i)
#define fe(it, n) for(auto &it : n)
#define mms(arr, val) memset(arr, val, sizeof arr)
#define mmv(vec, val) memset(vec[0], val, sizeof(vec) * SZ(vec))
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>

const int N = 2e5 + 5, MOD = 998244353, oo = 0x3f3f3f3f;
const ll ooo = 0x3f3f3f3f3f3f3f3f;

void testCase() {
    int n;
    string s;
    cin >> n >> s;
    reverse(s.begin(), s.end());
    vector<int> ans;
    ans.push_back(0);
    queue<int> q;
    for(int i = 0; i < n; ++i) {
        if (s[i] == '0')
            q.push(i);
    }
    for (int i = 0; i < n; ++i) {
        if (q.empty()) {
            ans.push_back(-1);
            continue;
        }
        int head = q.front(), lst = ans.back();
        ans.push_back(head - i + lst);
        q.pop();
    }
    for (int i = 1; i < ans.size(); ++i)
        cout << ans[i] << ' ';
    cout << '\n';
}

int main() {
    PG_Mazen
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    loop testCase();
}