output_description: Print the number of children standing on each square after the children
  performed the moves, in order from left to right.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      S
attempt: import math
  
  s = str(input())
  
  
  def split(word):
      return [char for char in word]
  
  
  splice = split(s)
  
  isrightcont = 0
  isleftcont = 0
  
  length = len(splice)
  
  moke = list()
  poke = list()
  rightatsumaru = list()
  leftatsumaru = list()
  
  for i in range(0, length):
      if i == length - 1:
          if isleftcont == 0:
              rightatsumaru.append(int(i))
              leftatsumaru.append(int(i) + 1)
              poke.append(isleftcont + 1)
              moke.append(isrightcont)
          else:
              poke.append(isleftcont + 1)
              moke.append(isrightcont)
      elif splice[i] == "R":
          if isleftcont > 0:
              poke.append(isleftcont)
              moke.append(isrightcont)
              isleftcont = 0
              isrightcont = 1
          else:
              isrightcont += 1
      else:
          if isleftcont == 0:
              rightatsumaru.append(int(i))
              leftatsumaru.append(int(i) + 1)
              isleftcont += 1
          else:
              isleftcont += 1
  
  tsumaranai = len(rightatsumaru)
  
  gideon = [0] * length
  for i in range(0, tsumaranai):
      gideon[rightatsumaru[i] - 1] = math.ceil(moke[i] / 2) + math.floor(poke[i] / 2)
      gideon[rightatsumaru[i]] = math.ceil(poke[i] / 2) + math.floor(moke[i] / 2)
  
  print(*gideon)
  
problem_description: Statement
  
  Given is a string S consisting of `L` and `R`.
  
  Let N be the length of S. There are N squares arranged from left to right, and
  the i-th character of S from the left is written on the i-th square from the
  left.
  
  The character written on the leftmost square is always `R`, and the character
  written on the rightmost square is always `L`.
  
  Initially, one child is standing on each square.
  
  Each child will perform the move below 10^{100} times:
  
    * Move one square in the direction specified by the character written in the square on which the child is standing. `L` denotes left, and `R` denotes right.
  
  Find the number of children standing on each square after the children
  performed the moves.
samples: [{"input": "RRLRL", "output": "0 1 2 1 1\n    \n\n  * After each child performed one move, the number of children standing on each square is 0, 2, 1, 1, 1 from left to right.\n  * After each child performed two moves, the number of children standing on each square is 0, 1, 2, 1, 1 from left to right.\n  * After each child performed 10^{100} moves, the number of children standing on each square is 0, 1, 2, 1, 1 from left to right.\n\n* * *"}, {"input": "RRLLLLRLRRLL", "output": "0 3 3 0 0 0 1 1 0 2 2 0\n    \n\n* * *"}, {"input": "RRRLLRLLRRRLLLLL", "output": "0 0 3 2 0 2 1 0 0 0 4 4 0 0 0 0"}]