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 main():
    try:
        # get input
        s = input('')
        n = len(s)

        # her original interval is [0, 1], so the first spot it falls is 1/2
        left = 0
        right = 1
        curr = -1
        d = 0
        
        #print("left: " + str(left) + ", right: " + str(right) + ", curr: " + str(curr))

        # stone locations
        stones = []

        for char in s:
            if char == 'l':
                curr = (left+right)/2
                stones.append(curr)
                right -= curr - left
                #print("[LEFT] left: " + str(left) + ", right: " + str(right) + ", curr: " + str(curr))
            elif char == 'r':
                curr = (left+right)/2
                stones.append(curr)
                left += right - curr
                #print("[RIGHT] left: " + str(left) + ", right: " + str(right) + ", curr: " + str(curr))

        print(stones)

        # reformat result
        sort = []
        for i in range(n):
              sort.append([stones[i],i+1]) 
        sort.sort(key=lambda x:x[0])
        
        indices = [x[1] for x in sort]

        # output result
        print(indices)
        
    except Exception as e:
        print(e)
        exit()
        
if __name__ == "__main__":
    main()

   	 		 				   		 	  				   	