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".
# CP 1 PROBLEM A

def printReverseArr(arr):
    arr.reverse()
    n = len(arr)
    for i in range(n):
        print(arr[i])
    
def main():
    try:
        # get input
        s = input('')

        # her original interval is [0, 1]
        left = 0
        right = 1

        # indices
        indices = []

        # index count, starts at 1
        i = 1

        # parse each letter
        for char in s:
            if char == 'l':
                indices.append(i)
            elif char == 'r':
                print(i)
            i += 1
            
        # output result
        printReverseArr(indices)
        
    except Exception as e:
        print(e)
        exit()
        
if __name__ == "__main__":
    main()

  				   						  	     	 	 	  	