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 Tree:
    def __init__(self, v):
        self.val = v
        self.left = None
        self.right = None


def p_tree(node):
    if node.left:
        p_tree(node.left)
    print(node.val)
    if node.right:
        p_tree(node.right)


s = input()
stone = 1
root = Tree(stone)
current = root
for i, d in enumerate(s[1:], 1):
    stone += 1
    if s[i-1] == "l":
        current.left = Tree(stone)
        current = current.left
    else:
        current.right = Tree(stone)
        current = current.right

p_tree(root)
