#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  char ch;
  scanf("%d\n", &n);
  vector<char> q;
  for (int i = 0; i < n - 1; ++i) {
    scanf("%c", &ch);
    q.push_back(ch);
  }
  vector<int> t(n, 1);
  int wa = 0;
  while (true) {
    bool ok = true;
    for (int i = wa; i < n - 1; ++i) {
      if (t[i] <= t[i + 1] && q[i] == 'L') {
        t[i] = t[i + 1] + 1;
        ok = false;
        wa = max(i - 1, 0);
        break;
      } else if (t[i] >= t[i + 1] && q[i] == 'R') {
        t[i + 1] = t[i] + 1;
        ok = false;
        wa = max(i - 1, 0);
        break;
      } else if (t[i] != t[i + 1] && q[i] == '=') {
        t[i] = t[i + 1] = max(t[i], t[i + 1]);
        ok = false;
        wa = max(i - 1, 0);
        break;
      }
    }
    if (ok) {
      break;
    }
  }
  for (int i = 0; i < n - 1; ++i) {
    printf("%d ", t[i]);
  }
  printf("%d\n", t[n - 1]);
  return 0;
}
