#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <map>
#include <iomanip>
#include <math.h> 
#include <stack>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <tuple>
#include <cctype>
#include <ctype.h>
#include <set>
#include <sstream>

using namespace std;


int main() {
	int i, j, k;   
	string s;
	
	cin >> s;

	if (s.find("treeone") != string::npos) {
		label:
		int iti = s.find("treeone");

		//cout << iti << endl;

		s.erase(s.begin() + iti, s.begin() + iti + 7);

		s.insert(iti, "forest");

		if (s.find("treeone") != string::npos) {
			goto label;
		}

		cout << s << endl;
	}
	else {
		cout << s << endl;
	}
	

	getchar();
	getchar();
	return 0;
}