#include <bits/stdc++.h>
using namespace std;
struct node {
  int k;
  node *next, *pre;
  node(int n) {
    k = n;
    next = NULL;
    pre = NULL;
  }
};
int main() {
  node *a = new node(1);
  string s;
  cin >> s;
  for (int i = 0; i < s.length() - 1; i++) {
    if (s[i] == 'r') {
      node *t = new node(a->k + 1);
      if (a->next != NULL) a->next->pre = t;
      t->pre = a;
      t->next = a->next;
      a->next = t;
      a = a->next;
    }
    if (s[i] == 'l') {
      node *t = new node(a->k + 1);
      if (a->pre != NULL) a->pre->next = t;
      t->next = a;
      t->pre = a->pre;
      a->pre = t;
      a = a->pre;
    }
  }
  while (a->pre != NULL) a = a->pre;
  while (a != NULL) {
    cout << a->k << endl;
    a = a->next;
  }
}
