#include <bits/stdc++.h>
using namespace std;
string vow = "aeiou";
int month[] = {-1, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int dxhorse[] = {-2, -2, -1, -1, 1, 1, 2, 2};
const int dyhorse[] = {1, -1, 2, -2, 2, -2, 1, -1};
const int dx[] = {-1, 0, 0, 1};
const int dy[] = {0, -1, 1, 0};
const long double pie = 3.14159265358979;
const long long mod = 1e9 + 7;
void solve(int test_case) {
  int n;
  cin >> n;
  vector<char> v(n);
  for (int i = 1; i < n; i++) cin >> v[i];
  vector<int> ans(n + 1, 1);
  for (int i = 1; i < n; i++) {
    if (v[i] == 'R') {
      ans[i] = ans[i - 1] + 1;
      continue;
      ;
    }
    if (v[i] == '=') {
      ans[i] = ans[i - 1];
      continue;
      ;
    }
    int j = i - 1;
    for (; j > -1; j--) {
      if (ans[j] > ans[j + 1]) break;
      ans[j]++;
      if (v[j] == 'R') break;
    }
  }
  for (int i = 0; i < n; i++) cout << ans[i] << " ";
  cout << "\n";
}
int main() {
  int t = 1;
  for (int i = 0; i < t; i++) solve(i);
  return 0;
}
