#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
#include <cassert>
#include <complex>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
const int inf = 1e8;


ll gcd(ll a, ll b) {
	if (b > a) {
		ll tmp = b;
		b = a;
		a = tmp;
	}
	if (a%b == 0)return b;
	else return gcd(b, a%b);
}

int main() {
    string s;
    cin>>s;
    for(int i=0;i<s.length();){
        if(i<s.length()-6){
            if(s[i]=='t')
                if(s[i+1]=='r')
                    if(s[i+2]=='e')
                        if(s[i+3]=='e')
                            if(s[i+4]=='o')
                                if(s[i+5]=='n')
                                    if(s[i+6]=='e'){
                                        cout<<"forest";
                                        i+=7;
                                        continue;
                                    }
            cout<<s[i];
            i++;
        }
        else{
            cout<<s[i];
            i++;
        }
    }
    cout<<endl;
}