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".
import sys
import math
from collections import defaultdict,Counter
from itertools import permutations
from collections import deque
 
 
def sin():
	return int(sys.stdin.readline())
 
def array():	
	return list(map(int, sys.stdin.readline().strip().split()))
 
def two():
	return map(int, sys.stdin.readline().strip().split())
 
def multiple():
	return [int(x) for x in sys.stdin.readline().split()]
 
def string():
	return sys.stdin.readline().strip()
 
def sqrt(x):
	low , high = 0 , x
	while low <= high:
		mid = (low + high) // 2
		if mid * mid <= x < (mid+1) * (mid+1):
			return mid
		elif x < mid * mid:
			high = mid - 1
		else:
			low = mid + 1
 
 
s = string()

ans = []

n = len(s)
k = 1
left1 = 0
right1 = 1/2
left2 = 1/2
right2 = len(s)
right = 1/2

if n == 1:
	print(1)
else:
	

	ans.append((right,k))
	k += 1

	for i in s:
		if i == "l":
			mid = (left1 + right1) / 2
			ans.append((mid , k))
			k += 1
			right2 = right1
			right1 = mid
			left2 = mid
		else:
			mid = (left2 + right2) / 2
			ans.append((mid , k))
			k += 1
			right1 = mid
			left1 = left2
			left2 = mid
		if k == n+1:
			break

	ans.sort()

	for i in ans:
		print(i[1])


