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".
def main():
    l = [-1, 0, 6, 0, 6, 0, 1, 0, 3]
    liss = 6
    for i, c in enumerate(input()[:-1], 2):
        l.append(i)
        if c == 'l':
            l.append(l[-3])
            l.append(liss)
            liss += 3
            l[l[-5] + 2] = l[-5] = liss
        else:
            l.append(liss)
            l.append(l[-3])
            liss += 3
            l[l[-4] + 1] = l[-4] = liss
    liss, res = l[2], []
    while l[liss]:
        res.append(l[liss])
        liss = l[liss + 2]
    print(' '.join(map(str, res)))


if __name__ == '__main__':
    main()