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".
'''input
lrlrr
'''
from sys import stdin
import sys
import copy
sys.setrecursionlimit(15000)


def create_dp(arr, n):
	dp1 = [-1] * n
	dp1[-1] = n - 1

	for i in range(n - 2, -1, -1):
		if arr[i] <= arr[i + 1]:
			dp1[i] = dp1[i + 1]
		else:
			dp1[i] = i

	dp2 = [-1] * n
	dp2[-1] = n - 1
	for i in range(n - 2, -1, -1):
		if arr[i] >= arr[i + 1]:
			dp2[i] = dp2[i + 1]
		else:
			dp2[i] = i
	return dp1, dp2


# main starts
string = list(stdin.readline().strip())
first = 0; last = 1
mylist = []
for i in range(len(string)):
	mid = (first + last) / 2
	d = abs(first - mid)
	if string[i] == 'l':
		mylist.append([i, mid])
		first = mid - d
		last = mid
	else:
		mylist.append([i, mid])
		first = mid
		last = mid + d

mylist = sorted(mylist, key = lambda x: x[1])
for i in mylist:
	print(i[0] + 1)

