#include <bits/stdc++.h>
using namespace std;
const int MaxN = 1005;
int n, m = 0;
int c[MaxN], s[MaxN];
char ch[MaxN];
int main() {
  scanf("%d", &n);
  scanf("%s", ch + 1);
  s[0] = 0;
  for (int k = 1; k < n; ++k) {
    if (ch[k] == '=')
      s[k] = s[k - 1];
    else {
      s[k] = s[k - 1] + 1;
      ch[++m] = ch[k];
    }
  }
  memset(c, 0, sizeof(c));
  for (int k = 0; k <= m; ++k) {
    int A = 0, B = 0;
    for (int t = k; t > 0 && ch[t] == 'R'; --t) ++A;
    for (int t = k + 1; t <= m && ch[t] == 'L'; ++t) ++B;
    c[k] = max(A, B) + 1;
  }
  for (int k = 0; k < n - 1; ++k) printf("%d ", c[s[k]]);
  printf("%d\n", c[s[n - 1]]);
  return 0;
}
