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".
class LN:
    data = None
    left = None
    right = None

    def __init__(self, data, left, right):
        self.data = data
        self.left = left
        self.right = right

inst = input()

root = LN(1, None, None)
ptr = root
i = 2

for j in range(len(inst)-1):
    if inst[j] == 'l':
        ptr.left = LN(i, ptr.left, ptr)
        if ptr.left.left:
            ptr.left.left.right = ptr.left
        ptr = ptr.left
        if root.left:
            root = root.left
    else:
        ptr.right = LN(i, ptr, ptr.right)
        if ptr.right.right:
            ptr.right.right.left = ptr.right
        ptr = ptr.right

    i += 1

trav = root
print(root.data)

while trav.right:
    trav = trav.right
    print(trav.data)
