#include <bits/stdc++.h>
using namespace std;
const long double EPS = 1e-9;
const long double PI = 3.1415926535897932384626433832795;
const int INF = 1000 * 1000 * 1000;
const int NMAX = 1000 * 1000;
long ans, i, j, k, l, n, m, x, y;
long a[10000];
long long mx, mn;
string s;
int main() {
  freopen("out.deb", "w", stderr);
  scanf("%d", &n);
  cin >> s;
  a[0] = 1;
  for (i = 0; i < s.length(); i++) {
    if (s[i] == 'L') {
      a[i + 1] = 1;
      j = i;
      if (a[i + 1] >= a[i]) a[i] = a[i + 1] + 1;
      j--;
      for (; j >= 0; j--) {
        if (s[j] == 'L') {
          if (a[j] <= a[j + 1]) a[j] = a[j + 1] + 1;
        }
        if (s[j] == '=') {
          a[j] = a[j + 1];
        }
        if (s[j] == 'R') {
          if (a[j] >= a[j + 1]) a[j + 1] = a[j] + 1;
        }
      }
    }
    if (s[i] == '=') {
      a[i + 1] = a[i];
    }
    if (s[i] == 'R') {
      a[i + 1] = a[i] + 1;
    }
  }
  for (i = 0; i < n; i++) printf("%d ", a[i]);
  return 0;
}
