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".
int_inp   = lambda: int(input()) #integer input
strng     = lambda: input().strip() #string input
strl      = lambda: list(input().strip())#list of strings as input
mul       = lambda: map(int,input().strip().split())#multiple integers as inpnut
mulf      = lambda: map(float,input().strip().split())#multiple floats as ipnut
seq       = lambda: list(map(int,input().strip().split()))#list of integers


#for i in range(int_inp()):
m =list(input())
n = [0]*len(m)
k = 0
def insertin(i):
    global n
    global k
    if i=='l':
        for j in range(len(n)-1,-1,-1):
            if n[j]==0:
                k += 1
                n[j]=k
                break
            else:
                continue
    if i=='r':
        for j in range(0,len(n)-1):
            if n[j]==0:
                k += 1
                n[j]=k
                break
            else:
                continue
for i in m :
    insertin(i)
for p in n:
    print(p)
