#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <string>
#include <map>
#include <iterator>
#include <set>
#include <queue>
#include <bitset>
#include <cassert>

using namespace std;


int main() {
    string S;
    cin >> S;
    string t = "treeone";
    string r;
    for (int i = 0; i < S.size(); ++i) {
        if (S.substr(i, t.size()) == t) {
            r += "forest";
            i = i + t.size()-1;
        } else {
            r += S[i];
        }
    }

    cout <<r<<endl;

    return 0;
}