Squirrel Liss lived in a forest peacefully, but unexpected trouble happens. Stones fall from a mountain. Initially Squirrel Liss occupies an interval [0, 1]. Next, *n* stones will fall and Liss will escape from the stones. The stones are numbered from 1 to *n* in order.

The stones always fall to the center of Liss's interval. When Liss occupies the interval [*k* - *d*, *k* + *d*] and a stone falls to *k*, she will escape to the left or to the right. If she escapes to the left, her new interval will be [*k* - *d*, *k*]. If she escapes to the right, her new interval will be [*k*, *k* + *d*].

You are given a string *s* of length *n*. If the *i*-th character of *s* is "l" or "r", when the *i*-th stone falls Liss will escape to the left or to the right, respectively. Find the sequence of stones' numbers from left to right after all the *n* stones falls.
The input consists of only one line. The only line contains the string *s* (1 ≤ |*s*| ≤ 10<sup class="upper-index">6</sup>). Each character in *s* will be either "l" or "r".
s = input()
# list = [1]
# n = len(s)
# index = 0
# for i in range(1,n):
#     if (s[i-1]=="l") :
#         list.insert(index, i+1)
#     else:
#         index += 1
#         list.insert(index, i+1)
# for num in list:
#     print(num)

n = len(s)
ans = [0]*n
left = n-1
right = 0
if (s[0]=="l") :
    ans[n-1] = 1
    left -= 1
else:
    ans[0] = 1
    right += 1
for i in range(1,n) :
    if (s[i]=="l") :
        ans[left] = i+1
        left -= 1
    else:
        ans[right] = i+1
        right += 1
print(ans)
