#include <bits/stdc++.h>
using namespace std;
int n;
char ch[1000100];
struct node {
  int i;
  node *next;
} a[1000100];
node *Root = &a[0], *cnt = &a[0];
void Addedge(int i) {
  node *p = ++cnt;
  p->i = i;
  p->next = Root->next;
  Root->next = p;
}
void Solve() {
  scanf("%s", ch);
  n = strlen(ch);
  for (int i = 0; i < n; i++) {
    Addedge(i + 1);
    if (ch[i] == 'r') Root = &a[i + 1];
  }
  for (node *p = a[0].next; p; p = p->next) printf("%d\n", p->i);
}
int main() {
  Solve();
  return 0;
}
