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".
from collections import deque
s=deque(('l'+input())[:-1])
le = []
ri = []
n=0
while s:
    c = 0;ref = s[0]
    while s and s[0] == ref: c+=1;s.popleft()
    #print(ref,c)
    if ref=='l':
        for i in range(c-1):
            ri.append(n+i+1);
        le.append(n+c)
        n=n+c
    elif ref=='r':
        for i in range(c-1):
            le.append(n+i+1);
        ri.append(n+c)
        n=n+c
    #print(le,ri)
le.extend(ri[::-1])
print('\n'.join([str(i) for i in le]))
