#include <iostream>
#include <algorithm>

using namespace std;

const int N = 10;
const int M = 100;

int main(){
	int n;
	while(cin >> n && n){
		int num[N+1];
		fill(num, num + N + 1, 0);
		for(int i=0;i<M;i++){
			char c;
			cin >> c;
			num[i%n]++;
			if(c == 'S'){
				num[n] += num[i%n];
				num[i%n] = 0; 
			}else if(c == 'L'){
				num[i%n] += num[n];
				num[n] = 0;
			}
		}
		sort(num, num + n);
		for(int i=0;i<=n;i++){
			if(i) cout << " ";
			cout << num[i];
		}
		cout << endl;
	}
	return 0;
}