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".
# setup
sequence = input("")
left = 0
right = 1
stone_positions = list()
curr_pos = (left + right)/2
stone_no = 1

# excercise
for elem in sequence:
    if(elem == 'l'):
        new_pos = (left + curr_pos)/2
        right = curr_pos
        curr_pos = new_pos
        stone_positions.append([right, stone_no])

    else:
        new_pos = (curr_pos + right)/2
        left = curr_pos
        curr_pos = new_pos
        stone_positions.append([left, stone_no])

    stone_no += 1

stone_positions = sorted(stone_positions, key = lambda x: x[0])
for stone in stone_positions:
    print(stone[1])
 						 								 	  			 				