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()
ret = []
ret.insert(0,1)
j = 0
l_r = 1
l = len(s)
for i in range(0,l-1):
    if s[i] == 'l':
        if j!= 0:
           if j == 1:
               #ret = ret[0]+list(i+2)+ret[1:]
               ret.insert(1,i+2)
           else:
               #ret = ret[0:j]+list(i+2)+ret[j:]
               ret.insert(j,i+2)
        else:
            #ret = list(i+2)+ret[j:]
            ret.insert(0,i+2)
        #print(str(i+2),ret,j)
    if s[i] == 'r':
        if j!= l_r - 1:
            #ret = ret[0:j+1]+list(i+2)+ret[j+1:]
            ret.insert(j+1,i+2)
            j=j+1
        else:
            #ret = ret+list(i+2)
            ret.append(i+2)
            j=j+1
        #print(str(i+2),ret,j)
    l_r += 1
for i in ret:
    print(i)
