#include <bits/stdc++.h>
using namespace std;
string tobin(int x, int len) {
  string c;
  while (x > 0) {
    c.push_back(x % 2 + '0');
    x >>= 1;
  }
  while (int((c).size()) < len) c.push_back('0');
  reverse((c).begin(), (c).end());
  return c;
}
char s[1000005];
int n;
vector<int> st;
void solve() {
  for (int i = 0; i < n; ++i) {
    if (s[i] == 'l')
      st.push_back(i);
    else
      printf("%d\n", i + 1);
  }
  for (int i = int((st).size()) - 1; i >= 0; --i) printf("%d\n", st[i] + 1);
}
int main() {
  scanf("%s", &s);
  n = strlen(s);
  solve();
  return 0;
}
