#include <bits/stdc++.h>
using namespace std;
class nod {
 public:
  int num;
  nod *l, *r;
  nod() { l = r = 0; }
};
int loc = 2;
nod *root = new nod;
char s[2100006];
int main() {
  nod *t;
  nod *now;
  now = root;
  root->num = 1;
  int i, j;
  scanf("%s", s);
  int l = strlen(s);
  for (i = 0; i < l - 1; ++i) {
    t = new nod;
    t->num = loc++;
    if (s[i] == 'l') {
      if (now->l != 0) {
        t->l = now->l;
        now->l->r = t;
      }
      t->r = now;
      now->l = t;
    } else {
      if (now->r != 0) {
        t->r = now->r;
        now->r->l = t;
      }
      t->l = now;
      now->r = t;
    }
    now = t;
  }
  while (now->l != 0) now = now->l;
  while (now != 0) {
    printf("%d\n", now->num);
    now = now->r;
  }
}
