#include<iostream>
#include<cassert>
#define rep(i,n) for(i=0;i<(int)(n);i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

string s;
const string t="treeone",tt="forest";

int main(){
    int i,j;
    string ans="";
    cin>>s;
    auto judge=[&](int head)->bool{
        int i;
        rep(i,t.length())if(s[head+i]!=t[i])return false;
        return true;
    };
    i=0;
    while(i<s.length()){
        if(i+t.length()-1<s.length()&&judge(i))ans+=tt,i+=t.length();
        else ans+=s[i++];
    }
    printf("%s\n",ans.c_str());
    return 0;
}