#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1000000;
const int INF = 1 << 28;
char s[MAX_N + 1];
int r[MAX_N];
int main() {
  scanf("%s", s);
  int n = 0;
  while (s[++n])
    ;
  int p = 0, q = n - 1;
  for (int i = (0); i < (n); i++) {
    if (s[i] == 'l')
      r[q--] = i;
    else
      r[p++] = i;
  }
  for (int i = (0); i < (n); i++) printf("%d\n", r[i] + 1);
  return 0;
}
