#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // std::ifstream in("input.txt");
    // std::cin.rdbuf(in.rdbuf());
    string s;
    cin >> s;
    string before = "treeone";
    string after = "forest";
    string ans = "";
    ll skip = 0;
    rep(i, len(s)) {
        if (skip > 0) {
            skip--;
            continue;
        }
        if (i <= (len(s) - len(before))) {
            bool f = true;
            rep(ii, len(before)) {
                if (before[ii] != s[i + ii]) {
                    f = false;
                    break;
                }
            }
            if (f) {
                skip = len(before) - 1;
                rep(ii, len(after)) {
                    ans += after[ii];
                }
            }
            else {
                ans += s[i];
            }
        }
        else {
            ans += s[i];
        }
    }
    cout << ans << endl;
    return 0;
}