# coding: utf-8

S = eval(input())

ans = [1 for i in range(len(S))]

tmp = []

lr = []

l, r = 0, 0

tl = 0

cnt = 0

for i in range(len(S) - 1):

    if S[i] + S[i+1] == "RL":

        r, l = i, i + 1

    if S[i] + S[i+1] == "LR":

        if cnt != 0:

            tl += 1

        for j in range(tl, i + 1):

            if j == r or j == l:

                continue

            if (j - r) % 2 == 0:

                ans[r] += 1

                ans[j] = 0

            else:

                ans[l] += 1

                ans[j] = 0

        cnt += 1

        tl = i

    if i == len(S) - 2:

        if cnt != 0:

            tl += 1

        for j in range(tl, i + 2):

            if j == r or j == l:

                continue

            if (j - r - 1) % 2 == 0:

                ans[l] += 1

                ans[j] = 0

            else:

                ans[r] += 1

                ans[j] = 0

print((*ans))
# coding: utf-8

from math import ceil

from bisect import bisect_left

S = eval(input())

L = []

r, l = 0, 0

cnt = 0

tl = 0

ans = [1 for _ in range(len(S))]

for i in range(len(S)-1):

    if S[i] == "R" and S[i+1] == "L":

        r, l = i, i+1

    if S[i] == "L" and S[i+1] == "R":

        if cnt != 0:

            tl += 1

        for j in range(tl, i+1):

            if j == r or j == l:

                continue

            if (j - r) % 2 == 0:

                ans[r] += 1

            else:

                ans[l] += 1

            ans[j] -= 1

        cnt += 1

        tl = i

    if i == len(S) - 2:

        if cnt != 0:

            tl += 1

        for j in range(tl, i+2):

            if j == r or j == l:

                continue

            if (j-r-1) % 2 == 0:

                ans[l] += 1

            else:

                ans[r] += 1

            ans[j] -= 1

print((*ans))
# coding: utf-8
S = eval(input())
ans = [1 for i in range(len(S))]
tmp = []
lr = []
l, r = 0, 0
tl = 0
cnt = 0
for i in range(len(S) - 1):
    if S[i] + S[i + 1] == "RL":
        r, l = i, i + 1
    if S[i] + S[i + 1] == "LR":
        if cnt != 0:
            tl += 1
        for j in range(tl, i + 1):
            if j == r or j == l:
                continue
            if (j - r) % 2 == 0:
                ans[r] += 1
                ans[j] = 0
            else:
                ans[l] += 1
                ans[j] = 0
        cnt += 1
        tl = i
    if i == len(S) - 2:
        if cnt != 0:
            tl += 1
        for j in range(tl, i + 2):
            if j == r or j == l:
                continue
            if (j - r - 1) % 2 == 0:
                ans[l] += 1
                ans[j] = 0
            else:
                ans[r] += 1
                ans[j] = 0
print((*ans))

# coding: utf-8
from math import ceil
from bisect import bisect_left

S = eval(input())
L = []
r, l = 0, 0
cnt = 0
tl = 0
ans = [1 for _ in range(len(S))]
for i in range(len(S) - 1):
    if S[i] == "R" and S[i + 1] == "L":
        r, l = i, i + 1
    if S[i] == "L" and S[i + 1] == "R":
        if cnt != 0:
            tl += 1
        for j in range(tl, i + 1):
            if j == r or j == l:
                continue
            if (j - r) % 2 == 0:
                ans[r] += 1
            else:
                ans[l] += 1
            ans[j] -= 1
        cnt += 1
        tl = i
    if i == len(S) - 2:
        if cnt != 0:
            tl += 1
        for j in range(tl, i + 2):
            if j == r or j == l:
                continue
            if (j - r - 1) % 2 == 0:
                ans[l] += 1
            else:
                ans[r] += 1
            ans[j] -= 1
print((*ans))

+from math import ceil +from bisect import bisect_left + -ans = [1 for i in range(len(S))] -tmp = [] -lr = [] -l, r = 0, 0 +L = [] +r, l = 0, 0 +cnt = 0 -cnt = 0 +ans = [1 for _ in range(len(S))] -    if S[i] + S[i + 1] == "RL": +    if S[i] == "R" and S[i + 1] == "L": -    if S[i] + S[i + 1] == "LR": +    if S[i] == "L" and S[i + 1] == "R": -                ans[j] = 0 -                ans[j] = 0 +            ans[j] -= 1 -                ans[j] = 0 -                ans[j] = 0 +            ans[j] -= 1