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".
# from sys import stdin
# def sin():
#     return stdin.readline()
#
#
# s = input()
#
# j=1
# l=[]
#
#
# for i in range(1,len(s)+1):
#     if s[i-1]=="l":
#         j=0
#         l.insert(j,i)
#     else:
#         j=1
#         l.insert(j,i)
#     print(l)
#
# for i in l:
#     print(i)


from sys import stdin
def sin():
    return stdin.readline()


s = input()
l=[]
x=0
y=10**6
for i in range(len(s)):
    ans=0
    if s[i]=="l":
        ans=(x+y)/2
        y=ans
    else:
        ans=(x+y)/2
        x=ans
    l.append([i+1,ans])

l.sort(key=lambda x:x[1])

# print(l)

for i in l:
    print(i[0])
