#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int findTreeOne(string S, int i){
  for(; i < S.size(); i++){
    if(
      S[i]   == 't' &&
      S[i+1] == 'r' &&
      S[i+2] == 'e' &&
      S[i+3] == 'e' &&
      S[i+4] == 'o' &&
      S[i+5] == 'n' &&
      S[i+6] == 'e'
    ){
      return i;

    }
  }
  return -1;
}

int main(void){
  string S;
  cin >> S;
  int itree = 7;
  if(itree > (int)S.size()){
    cout << S << endl;
    return 0;

  }
  string sforest = "forest";
  for(int i = 0; i < (int)S.size(); i++){
    int k = findTreeOne(S, i);
    if(0 <= k){
      S.replace(k, itree, sforest);
      i = k + itree - 2;

    }
  }
  cout << S << endl;
  return 0;
}