#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lb = 1000;
void azmuth(long long n = 12) {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout << setprecision(n) << fixed;
}
void solve() {
  long long n;
  string s;
  cin >> n >> s;
  vector<long long> ans(n);
  ans[0] = 1;
  for (long long i = 0; i < n - 1; i++) {
    if (s[i] == '=') {
      ans[i + 1] = ans[i];
      continue;
    }
    if (s[i] == 'L') {
      ans[i + 1] = 1;
      continue;
    }
    ans[i + 1] = 1 + ans[i];
  }
  for (long long i = n - 2; i >= 0; i--) {
    if (s[i] == 'L') {
      ans[i] = max(ans[i], ans[i + 1] + 1);
    } else if (s[i] == 'R') {
      ans[i] = min(ans[i], ans[i + 1] - 1);
    } else
      ans[i] = ans[i + 1];
  }
  for (auto a : ans) cout << a << " ";
  cout << "\n";
  ;
}
int32_t main() {
  azmuth();
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
