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 os
import sys
import math
from collections import deque, defaultdict
import bisect
import heapq

#sys.setrecursionlimit(1000000)
input = sys.stdin.readline


def multiple():
    a = map(int, input().split())
    return a


def array():
    a = input().split()
    return a


def intarray():
    a = list(map(int, input().split()))
    return a


def intinput():
    n = int(input())
    return n


def strinput():
    s = input().strip()
    return s


def isPrime(n):
    val = int(math.sqrt(n)) + 1
    for i in range(2, val):
        if n % i == 0:
            return False
    return True


def solution():
    # MOD = 998244353
    MOD = 1000000007
    s = strinput()
    a = [1]
    b = []
    count = 2
    for x in range(len(s)-1):
        i = s[x]
        if i == 'l':
            a.append(count)
        else:
            val = a[-1]
            a.pop()
            a.append(count)
            b.append(val)
        count += 1
    for i in b:
        print(i)
    for i in reversed(range(len(a))):
        print(a[i])
    return


t = 1
# t = int(input())
for _ in range(t):
    # print("Case #%s:" % str(_ + 1), end=' ')
    solution()
