#include<vector>
#include<iostream>
#include<stdio.h>
#include<string>
#include<utility>
#include<algorithm>

#define loop while(1)
#define SZ(x) ((int)(x).size())
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define pushb push_back
#define popb pop_back
#define VI vector<int> 
#define VVI vector<VI>

typedef long long int ll;


using namespace std;


int main()
{
    string str,tmp_str;
    string solve_str;
    cin>>str;
    string treestr = "treeone";
    int tmp=0;
    REP(i,str.length()){
        
        if(str[i]==treestr[tmp]){
            tmp_str +=str[i];
            tmp++;
        }
        else {
            tmp_str+=str[i];
            solve_str+=tmp_str;
            tmp_str.clear();
            tmp=0;
        }
        if(tmp_str == treestr){
            solve_str+="forest";
            tmp=0;
            tmp_str.clear();
        }
    }
    if(tmp_str.length() !=0)solve_str+=tmp_str;
    cout<<solve_str<<endl;
	return 0;
}