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".
# DO NOT EDIT THIS
import math
import sys
input = sys.stdin.readline
from collections import deque, defaultdict
import heapq
def counter(a):
    c = defaultdict(lambda : 0) # way faster than Counter
    for el in a:
        c[el] += 1
    return c

def inp(): return [int(k) for k in input().split()]
def si(): return int(input())
def st(): return input()

# DO NOT EDIT ABOVE THIS

s = [c for c in st() if c.isalpha()]
res = []
n = len(s)
x, y = 0., 1.

for i in range(1, n + 1):
    spot = (x + y) / 2
    res.append([spot, i])
    x, y = (x, spot) if s[i - 1] == 'l' else (spot, y)

res.sort()
for a, b in res:
    print(b)


