#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    string s;
    cin >> s;
    int n = s.size();

    rep(i,n){
        if(n - i < 7){
            cout << s[i];
        }else{
            int flag = 0;
            if(s[i + 0] == 't')flag++;
            if(s[i + 1] == 'r')flag++;
            if(s[i + 2] == 'e')flag++;
            if(s[i + 3] == 'e')flag++;
            if(s[i + 4] == 'o')flag++;
            if(s[i + 5] == 'n')flag++;
            if(s[i + 6] == 'e')flag++;
            if(flag == 7){
                cout << "forest";
                i += 6;
            }else{
                cout << s[i];
            }
        }
    }
    cout << endl;

    return 0;
}