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
    if (ans[i]-ans[i+1]).abs.odd?
      a = ans[i] < ans[i+1] ? [n, n+1] : [n+1, n]
      if (ans[i] < ans[i+1] && ans[i+1].even?) || (ans[i] > ans[i+1] && ans[i].even?)
        a.reverse!
      end
      ans[i], ans[i+1] = *a
    else
      ans[i] = n
      ans[i+1] = n
    end
    i += 2
  end
end
puts ans
