#include <bits/stdc++.h>
typedef struct node {
  int info;
  struct node *next;
} * NODPTR;
NODPTR make(int n) {
  NODPTR p = (NODPTR)malloc(sizeof(struct node));
  p->info = n;
  p->next = NULL;
  return p;
}
int main() {
  char str[1000010];
  scanf("%s", str);
  int n = strlen(str);
  int i;
  NODPTR L = NULL, S = NULL, SL = NULL;
  NODPTR p;
  for (i = 0; i < n; i++) {
    p = make(i + 1);
    if (str[i] == 'l') {
      p->next = L;
      L = p;
    } else {
      if (S == NULL)
        S = p;
      else
        SL->next = p;
      SL = p;
    }
  }
  while (S != NULL) {
    printf("%d\n", S->info);
    S = S->next;
  }
  while (L != NULL) {
    printf("%d\n", L->info);
    L = L->next;
  }
  return 0;
}
