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()
  length = len(S)
  ans = [0] * length
  pre_s = ""
  start_i = 0
  for i, s in enumerate(S):
      if pre_s == "R" and s == "L":
          r_i = i - 1
          l_i = i
      elif pre_s == "L" and s == "R":
          end_i = i - 1
          n = end_i - start_i + 1
          ans[r_i] = 1 + (end_i - l_i + 1) // 2 + (r_i - start_i) // 2
          ans[l_i] = n - ans[r_i]
          start_i = i
      if i == length - 1:
          end_i = i
          n = end_i - start_i + 1
          ans[r_i] = 1 + (end_i - l_i + 1) // 2 + (r_i - start_i) // 2
          ans[l_i] = n - ans[r_i]
      pre_s = s
  print(" ".join([str(i) for i in ans]))
  
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"}]