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

	def insert_right(self, node):
		node.right = self.right
		node.left = self
		if self.right:
			self.right.left = node 
		self.right = node
		return

	def insert_left(self, node):
		node.left = self.left
		node.right = self
		if self.left:
			self.left.right = node 
		self.left = node

	def get_start(self):
		node = self
		while node.left:
			node = node.left
		return node

if __name__ == '__main__':
	moves = input()
	high = 1
	low = 0
	position = dict()
	curr_node = linked_list(1)

	for idx,char in enumerate(moves[:-1]):
		new_node = linked_list(idx+2)
		# print("Dd"+str(idx+2), curr_node.val)
		
		if char == 'l':
			curr_node.insert_left(new_node)
		else:
			curr_node.insert_right(new_node)

		curr_node = new_node

		
	node = curr_node.get_start()

	while node:
		print(node.val)
		node = node.right