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 Node:
    def __init__(self, val):
        self.val = val
        self.next = None
        self.prev = None


def insert(dir, list_head, ptr):

    curr_ptr = Node(ptr.val+1)

    if dir == 'l':
        if ptr.prev == None:
            curr_ptr.next = ptr
            ptr.prev = curr_ptr
            return curr_ptr, curr_ptr
        else:
            ptr.prev.next = curr_ptr
            curr_ptr.prev = ptr.prev
            curr_ptr.next = ptr
            ptr.prev = curr_ptr
            return list_head, curr_ptr

    else:
        if ptr.next == None:
            ptr.next = curr_ptr
            curr_ptr.prev = ptr
            return list_head, curr_ptr
        else:
            curr_ptr.next = ptr.next
            ptr.next.prev = curr_ptr
            ptr.next = curr_ptr
            curr_ptr.prev = ptr
            return list_head, curr_ptr


s = input().strip();
list_head = Node(1)
curr_ptr = list_head
for i in range(len(s)-1):
    list_head, curr_ptr = insert(s[i], list_head, curr_ptr)

while(list_head):
    print(list_head.val)
    list_head = list_head.next
