S = gets.chomp

ans = Array.new(S.size, 0)

c = 0
l = 0
0.step(S.size) do |i|
  s = S[i]
  n = S[i+1]
  c += 1
  if s != n
    if s == ?R
      ans[i] = c
      l = i+1
    else
      ans[l] = c
    end
    c = 0
  end
end
i = 0
while i < ans.size
  if ans[i] == 0
    i += 1
  else
    n = (ans[i] + ans[i+1]) / 2
    a = (ans[i]-ans[i+1]).abs
    if a.odd?
      if ans[i] < ans[i+1]
        ans[i] = n
        ans[i+1] = n + 1
        ans[i], ans[i+1] = ans[i+1], ans[i] if ans[i].odd?
      else
        ans[i] = n + 1
        ans[i+1] = n
        ans[i], ans[i+1] = ans[i+1], ans[i] if ans[i+1].odd?
      end
    else
      ans[i] = n
      ans[i+1] = n
    end
    i += 2
  end
end
puts ans
