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".
from sys import *
from bisect import *
from collections import *
from itertools import *
from fractions import *
from datetime import *
from math import *

Input = []

#stdin = open('in', 'r')
#stdout = open('out', 'w')

## for i, val in enumerate(array, start_i_value)

def Out(x):
    stdout.write(str(x) + '\n')

def In():
    return stdin.readline().strip()

def inputGrab():
    for line in stdin:
        Input.extend(map(str, line.strip().split()))
'''--------------------------------------------------------------------------------'''


def Mid(l, r):
    k = r - l
    k = k / 2
    return k

def Cmp(elem):
    return elem[1]

def main():
    s = In()
    l = Fraction(0, 1)
    r = Fraction(1, 1)
    
    Ans = []
    for i, d in enumerate(s):
        #print("Present", l.numerator, l.denominator, r.numerator, r.denominator)
        if d == 'l':
            k = Mid(l, r)
            r -= k
            #print("K", k.numerator, k.denominator)
            Ans.append((i, r))
        else:
            k = Mid(l, r)
            l += k
            #print("K", k.numerator, k.denominator)
            Ans.append((i, l))
        #print("New", l.numerator, l.denominator, r.numerator, r.denominator)
    
    Ans.sort(key = Cmp)
    
    for x, y in Ans:
        print(x+1)
    

    
if __name__ == '__main__':
    main()
