#include <bits/stdc++.h>
using namespace std;
struct node {
  int pos;
  int id;
} k[1000005];
bool cmp(node x, node y) { return x.pos < y.pos; }
int main() {
  string s;
  cin >> s;
  int len = s.size();
  int minn = 0;
  int maxx = len;
  for (int i = 1; i <= len; i++) {
    k[i].id = i;
    if (s[i - 1] == 'l') {
      k[i].pos = maxx--;
    } else {
      k[i].pos = minn++;
    }
  }
  sort(k + 1, k + len + 1, cmp);
  for (int i = 1; i <= len; i++) {
    printf("%d\n", k[i].id);
  }
}
