#include<iostream>
#include <algorithm>
#include<string>
#include <bitset>
#include <vector>
#include <functional>
#include <climits>
#include <iomanip>
#include <utility>
using namespace std;
using ll = long long;
typedef pair <int, int> pii;
int main()
{

	//int a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, g = 0, h = 0, ans = 0;
	ll a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, g = 0, h = 0, i = 0, j = 0, k = 0, l = 0, ans = 0;
	//cout << LONG_MAX << endl;
	string s;
	//long long n, A[1000000000];
	int n, m, q;
	//int   y[100001], z[100001], x[10001] = {};
	//pii y[100001];
	//pair<int, float> pii[100001];
	ll A[100001];
	cin >> s;
	for ( a = 0; a < s.length(); a++)
	{
		/*if (a+6>=s.length())
		{

		}*/
		if (s[a] == 't'&&s[a+1] == 'r'&&s[a+2] == 'e'&&s[a + 3] == 'e'&&s[a + 4] == 'o'&&s[a + 5] == 'n'&&s[a+6] == 'e')
		{
			cout << "forest";
			a += 6;
		}
		else
		{
			cout << s[a];
		}

	}


	////std::cout << std::fixed;
	//cout << std::setprecision(20) << << endl;
	//cout << d+1 << endl;
	//cout << "" << endl;


	return 0;
}