#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <map>

int main(void) {

	std::string s;
	std::cin >> s;

	auto pos = s.find("treeone");

	while ((pos = s.find("treeone")) != std::string::npos) {
		s.replace(pos, 7U, "forest");
		pos += 8;
	}

	std::cout << s << std::endl;
	return 0;
}