#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i=a; i<n; i++)
#define RREP(i, a, n) for(ll i=n-1; i>=a; i--)
typedef long long ll;
const ll mod =1e9+7;
const ll inf =1e18;
using namespace std;

string s;
int main() {
    cin>>s;

    ll idx=0;
    ll num=s.find("treeone", idx);
    while(num != string::npos){
        REP(i, idx, num) cout<<s[i];
        cout<<"forest";

        idx=num+7;
        num=s.find("treeone", idx);
    }
    REP(i, idx, s.size()) cout<<s[i];
    cout<<endl;
    return 0;
}