#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, suml = 1, diff = 0;
  string s;
  cin >> n >> s;
  int toffees[n];
  for (int i = 0; i < n; i++) {
    toffees[i] = 1;
  }
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == '=') {
      toffees[i + 1] = toffees[i];
    } else if (s[i] == 'L') {
      for (int j = i; j < s.size(); j++) {
        if (s[j] == 'L') {
          suml++;
        } else if (s[j] == '=')
          continue;
        else
          break;
      }
      if (s[i - 1] == 'R' || s[i - 1] == '=') {
        toffees[i] = max(suml, toffees[i]);
        suml = 1;
        continue;
      }
      toffees[i] = suml;
      if (s[i - 1] == '=' && toffees[i - 1] > toffees[i]) {
        for (int j = i - 1; j > -1; j--) {
          if (s[j] == '=') {
            toffees[j] = suml + diff;
            toffees[j + 1] = suml + diff;
          } else
            break;
        }
      }
      suml = 1;
    } else {
      for (int j = i + 1; j < s.size(); j++) {
        if (s[j] == 'L') {
          suml++;
        } else if (s[j] == '=')
          continue;
        else
          break;
      }
      toffees[i + 1] = max(suml, toffees[i] + 1);
      suml = 1;
      diff = 0;
    }
  }
  for (int k = 0; k < n; k++) {
    for (int i = 0; i < s.size(); i++) {
      if (s[i] == '=') {
        if (toffees[i] != toffees[i + 1]) {
          toffees[i] = toffees[i + 1];
        } else if (s[i - 1] == 'L' && s[i - 2] == 'L') {
          toffees[i] = toffees[i + 1];
        }
      }
      if (s[i] == 'R' && i != 0) {
        if (toffees[i] == toffees[i + 1]) {
          toffees[i + 1] = toffees[i] + 1;
        }
        if (s[i + 1] == '=') {
          toffees[i + 2] = toffees[i + 1];
        }
      }
    }
  }
  for (int i = 0; i < n; i++) {
    cout << toffees[i] << " ";
  }
  return 0;
}
