#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000 + 10;
const int inf = (-1u) >> 1;
char s[maxn];
int n, a[maxn];
int main() {
  while (scanf("%d", &n) != EOF) {
    scanf("%s", s);
    memset(a, 0, sizeof(a));
    for (int k = 0; k < (n); ++k)
      for (int i = 0; i < (n - 1); ++i) {
        if (s[i] == '=') {
          a[i] = a[i + 1] = max(a[i], a[i + 1]);
        } else if (s[i] == 'L') {
          a[i] = max(a[i], a[i + 1] + 1);
        } else {
          a[i + 1] = max(a[i + 1], a[i] + 1);
        }
      }
    for (int i = 0; i < (n); ++i) {
      printf("%d%c", a[i] + 1, i == n - 1 ? '\n' : ' ');
    }
  }
  return 0;
}
