#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 28;
string s;
int main() {
  cin >> s;
  queue<int> f;
  stack<int> b;
  for (int i = (0); i < ((int)s.size()); i++) {
    if (s[i] == 'l')
      b.push(i);
    else
      f.push(i);
  }
  while (!f.empty()) {
    cout << f.front() + 1 << endl;
    f.pop();
  }
  while (!b.empty()) {
    cout << b.top() + 1 << endl;
    b.pop();
  }
  return 0;
}
