#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
int n;
vector<pair<int, int> > g[N];
int dist[N];
bool st[N];
void spfa(int s) {
  queue<int> q;
  st[s] = true;
  dist[s] = 1;
  q.push(s);
  while (q.size()) {
    auto x = q.front();
    q.pop();
    st[x] = false;
    for (auto t : g[x]) {
      int y = t.first, w = t.second;
      if (dist[y] < dist[x] + w) {
        dist[y] = dist[x] + w;
        if (!st[y]) {
          st[y] = true;
          q.push(y);
        }
      }
    }
  }
}
int main() {
  cin >> n;
  for (int i = 1; i < n; i++) {
    char c;
    cin >> c;
    if (c == '=') {
      g[i].push_back({i - 1, 0});
      g[i - 1].push_back({i, 0});
    } else if (c == 'L') {
      g[i].push_back({i - 1, 1});
    } else {
      g[i - 1].push_back({i, 1});
    }
  }
  for (int i = 0; i < n; i++) {
    dist[i] = -1;
    st[i] = false;
  }
  for (int i = 0; i < n; i++) {
    if (dist[i] == -1) spfa(i);
  }
  for (int i = 0; i < n; i++) cout << dist[i] << ' ';
  cout << endl;
  return 0;
}
