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: S = input()
  rl = [0]
  f = 0
  for c in S:
      if (c == "R" and f % 2 == 1) or (c == "L" and f % 2 == 0):
          f += 1
          rl.append(0)
      rl[f] += 1
  rla = [0] * len(rl)
  rla[0] = rl[0]
  for i in range(len(rl) - 1):
      rla[i + 1] = rla[i] + rl[i + 1]
  a = [0] * len(S)
  for i in range(len(rl) // 2):
      a[rla[i * 2] - 1] = (rl[i * 2] + 1) // 2 + rl[i * 2 + 1] // 2
  for i in range(len(rl) // 2):
      a[rla[i * 2]] = rl[i * 2] // 2 + (rl[i * 2 + 1] + 1) // 2
  print(*a)
  
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"}]