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".
# len(stone_sequence) will be equal to len(jump_sequence)
jump_sequence = input()
stone_sequence_interval = [0]*len(jump_sequence)
index_from_right = len(jump_sequence) - 2
index_from_left = 0

if jump_sequence[0] == 'l':
    stone_sequence_interval[-1] = 1
    index_from_right = len(jump_sequence) - 2
    index_from_left = 0

if jump_sequence[0] == 'r':
    stone_sequence_interval[0] = 1
    index_from_right = len(jump_sequence) - 1
    index_from_left = 1

if len(jump_sequence) > 1:
    for ith_jump in range(len(jump_sequence) - 1):
        if jump_sequence[ith_jump] == 'l':
            if jump_sequence[ith_jump + 1] == 'r':
                stone_sequence_interval[index_from_left] = ith_jump + 2
                index_from_left += 1

            else:
                stone_sequence_interval[index_from_right] = ith_jump + 2
                index_from_right -= 1
        else:
            if jump_sequence[ith_jump + 1] == 'l':
                stone_sequence_interval[index_from_right] = ith_jump + 2
                index_from_right -= 1

            else:
                stone_sequence_interval[index_from_left] = ith_jump + 2
                index_from_left += 1

for ith_jump_interval in stone_sequence_interval:
    print(ith_jump_interval)