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".

s = input()
# s = 'lrlrr'

class Node:
  def __init__(self, value, left = None, right = None):
    self.value = value
    self.left = left
    self.right = right

currentNode = Node(1)

for i in range(len(s) - 1):
  newNode = Node(i + 2)

  if (s[i] == 'r'):
    newNode.right = currentNode
    newNode.left = currentNode.left
    if (currentNode.left != None):
      currentNode.left.right = newNode
    currentNode.left = newNode
  else:
    newNode.left = currentNode
    newNode.right = currentNode.right
    if (currentNode.right != None):
      currentNode.right.left = newNode
    currentNode.right = newNode
  currentNode = newNode

while currentNode.right != None:
  currentNode = currentNode.right

print(currentNode.value)
while currentNode.left != None:
  currentNode = currentNode.left
  print(currentNode.value)
