#include <bits/stdc++.h>

using ll = long long;
using namespace std;

const int MAXN = 1'000'001;

struct State {
    int res = 0, extra = 0, upgraded = 0;
};

State operator+(State a, State b) {
    return {a.res + b.res, a.extra + b.extra, a.upgraded + b.upgraded};
}

char s[MAXN];
int ans[MAXN];

void solve() {
    int n; cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> s[i];
    }
    
    stack<State> blocked;
    State curr;
    for (int i = n; i >= 1; i--) {
        if (s[i] == 'H') {
            blocked.push(curr);
            curr = State();
        } else  {
            bool used = true;
            if (blocked.empty()) {
                if (curr.upgraded) {
                    curr.upgraded--;
                    curr.res++;
                } else if (curr.extra) {
                    curr.extra--;
                    curr.upgraded++;
                } else {
                    used = false;
                }
                
            } else {
                curr = curr + blocked.top(); 
                curr.res++;
                blocked.pop();
            }
            if (s[i] == 'M') {
                if (used) curr.extra++;
                else curr.upgraded++;
            }
        }

        ans[i] = curr.res;
    }

    for (int i = 1; i <= n; i++) {
        cout << ans[i] << " ";
    }
    cout << "\n";
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}