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()
l = 0
r = 1

m = 1/2
a = []
a.append(m)

b = []
b.append(1)

i = 0
while i < len(s) - 1:
    if s[i] == 'l':
        r = m
    else:
        l = m

    m = (l + r) / 2
    i += 1

    x = a.pop()
    a.append(x)
    while m > x and len(a) != 0:
        print(b.pop())
        a.pop()

        if len(a) == 0:
            break
        x = a.pop()
        a.append(x)

    a.append(m)
    b.append(i + 1)

while len(b) != 0:
    print(b.pop())
        



    
