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('')
a=0
b=1
e=0
f=1
d=[]
x={}
p=0
q=0
for i in range(0,len(s)):
    c=(a+b)/2
    d.append(c)
    x[c]=i+1
    if s[i]=='l':
        if q==1:
            a = c
            m=b-a
            a=c-m
            b=c
            q=0
            p=1
        else:
            p=1
            b=c
    else:
        if p==1:
            b = c
            m=b-a
            a=c
            b=c+m
            q=1
            p=0
        else:
            q=1
            a=c
d.sort()
for i in range(0,len(s)):
    print(x[d[i]])