#include <bits/stdc++.h>
using namespace std;
long long GCD(long long a, long long b) { return b != 0 ? GCD(b, a % b) : a; }
long long LCM(long long a, long long b) { return a * (b / GCD(a, b)); }
long long Pow(long long n, long long e) {
  if (e == 0) return 1;
  if (e == 1)
    return n;
  else if (e & 1) {
    long long t = Pow(n, e / 2);
    return n * t * t;
  } else {
    long long t = Pow(n, e / 2);
    return t * t;
  }
}
int v[1005], l[1005], r[1005];
int main() {
  int N;
  scanf("%d", &N);
  string s;
  getline(cin, s);
  getline(cin, s);
  for (int i = 0, max_ = (N); i < max_; ++i) ++v[i];
  for (int i = 0, max_ = ((int)(s).size()); i < max_; ++i) {
    if (s[i] == '=') {
      l[i + 1] = l[i];
    } else if (s[i] == 'L') {
      l[i + 1] = 0;
    } else if (s[i] == 'R') {
      l[i + 1] = l[i] + 1;
    }
  }
  for (int i = ((int)(s).size()) - 1; i >= 0; --i) {
    if (s[i] == '=') {
      r[i] = r[i + 1];
    } else if (s[i] == 'L') {
      r[i] = r[i + 1] + 1;
    } else if (s[i] == 'R') {
      r[i] = 0;
    }
  }
  for (int i = 0, max_ = (N); i < max_; ++i) v[i] = 1 + max(l[i], r[i]);
  for (int i = 0, max_ = (N); i < max_; ++i) printf("%d ", v[i]);
  return 0;
}
