#include "bits/stdc++.h"

using namespace std;

void solve()
{
    string s;
    cin >> s;
    int k = s.size();
    while (s[k - 1] != 'F')
        k--;
    cout << s.substr(0, k - 1) << endl;
}

int main()
{
    solve();
    return 0;
}

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const ll INF = 1LL<<60;

ll gcd(ll a, ll b) {
  if(b == 0) return a;
  return gcd(b, a % b);
}

template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }

ll modpow(ll a, ll n, ll mod) {
  ll res = 1;
  while (n > 0) {
    if (n & 1) res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  string S;
  cin >> S;

  string ans;
  ans = "";
  for(int i = 0; i + 8 < S.length(); i++){
    ans += S[i];
  }

  cout << ans << endl;

  return 0;
}
