Problem:
 Score : 100 points    Problem Statement Rng is going to a festival.  The name of the festival is given to you as a string S , which ends with FESTIVAL , from input. Answer the question: "Rng is going to a festival of what?" Output the answer.  Here, assume that the name of "a festival of s " is a string obtained by appending FESTIVAL to the end of s .
For example, CODEFESTIVAL is a festival of CODE .      Constraints  9 \leq |S| \leq 50  S consists of uppercase English letters.  S ends with FESTIVAL .         Input Input is given from Standard Input in the following format:  S       Output Print the answer to the question: "Rng is going to a festival of what?"        Sample Input 1 CODEFESTIVAL      Sample Output 1 CODE  This is the same as the example in the statement.       Sample Input 2 CODEFESTIVALFESTIVAL      Sample Output 2 CODEFESTIVAL  This string is obtained by appending FESTIVAL to the end of CODEFESTIVAL , so it is a festival of CODEFESTIVAL .       Sample Input 3 YAKINIKUFESTIVAL      Sample Output 3 YAKINIKU

Solution (Python):
S = input()
print(S[:-8])

Solution (Python):
s = input()
print(s[0:len(s)-8])

Solution (Python):
s=input()

print(s[:(len(s)-8)])

Solution (Python):
print(input()[:-8])

Solution (Python):
s = input()
print(s[:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):

s=input()
print(s[:-8])

Solution (Python):
s=input()
print(s[:-8])

Solution (Python):
def main():
    s = input()
    print(s[:-8])


if __name__ == "__main__":
    main()

Solution (Python):
S = input()
print(S[:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
import sys, math
from functools import lru_cache
import numpy as np
from collections import defaultdict
sys.setrecursionlimit(10**9)
MOD = 10**9+7

def input():
    return sys.stdin.readline()[:-1]

def mi():
    return map(int, input().split())

def ii():
    return int(input())

def i2(n):
    tmp = [list(mi()) for i in range(n)]
    return [list(i) for i in zip(*tmp)]


def makePrimeChecker(n):
    isPrime = [True] * (n + 1)
    isPrime[0] = False
    isPrime[1] = False
    for i in range(2, int(n ** 0.5) + 1):
        if isPrime[i]:
            for j in range(i * i, n + 1, i):
                isPrime[j] = False
    return isPrime


def main():
    S = input()
    print(S[:-8])

if __name__ == '__main__':
    main()

Solution (Python):

import sys
def input():
    return sys.stdin.readline()[:-1]

def main():
    S = input()
    ans = S[0: -8]
    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):
print(input()[:-8])

Solution (Python):
s = input()
print(s[:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
s=input()
print(s[0:(len(s)-8)])

Solution (Python):
print(input()[:-8])

Solution (Python):
s = input()
print(s[:-8])

Solution (Python):
s = input()
print(s[:len(s)-8])

Solution (Python):
S = input ()
print (S[:-8])

Solution (Python):
a=input()
print(a[0:len(a)-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
print(input()[0:-8])

Solution (Python):
S=input()
for i in range(len(S)-8):
    print(S[i],end="")

Solution (Python):
print(input()[:-8])

Solution (Python):
'''
Created on 2020/08/20

@author: harurun
'''
def main():
  import sys
  pin=sys.stdin.readline
  pout=sys.stdout.write
  perr=sys.stderr.write
  
  S=pin()[:-1]
  print(S[:-8])
  return 

main()

Solution (Python):
s=input()
print(s[0:len(s)-8])

Solution (Python):

s=input()
n=len(s)-len("FESTIVAL")
ans=""
for i in range(n):
    ans+=s[i]
print(ans)

Solution (Python):
S = input()
tmp = len(S)
S = S[0:tmp-8]
print(S)

Solution (Python):
s = input()
ans = s[:len(s)-8]
print(ans)

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    S = input()
    print(S[:-8])


if __name__ == '__main__':
    main()

Solution (Python):
s = input()
print(s[:-8])

Solution (Python):
s = input()
print(s[:-8])

Solution (Python):
s = input()
print(s[:-8])

Solution (Python):
s = list(input())
ans = s[0 : len(s) - 8]
print("".join(ans))

Solution (Python):
s = input()

print(s[:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
n = input()

print(n[:-8])

Solution (Python):
S=input()
for i in reversed(range(len(S))):
  if S[i]=="F":
    print(S[:i])
    exit()

Solution (Python):
s = input()
print(s[:-8])

Solution (Python):
s = input()
print(s[:-8])

Solution (Python):
a = input()
print(a[:(len(a)-8)])

Solution (Python):


def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    S=input()
    print(S[:-8])

main()

Solution (Python):
def main():
    s=input()
    print(s[0:len(s)-len("FESTIVAL")])

main()

Solution (Python):
s = input()
n = len(s)
ans = s[:n - 8]
print(ans)

Solution (Python):
print(input()[0:-8])

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    S = input().rstrip()
    ans = S[:-8]
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
s = input()

print(s[:-8])

Solution (Python):
n = input()
print(n[:-8])

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

S = input()
print(S[:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
s = input()

print(s[:-8])

Solution (Python):
s=str(input())
ans=[]
for i in range(len(s)-8):
  ans.append(s[i])
print("".join(ans))

Solution (Python):
def main():
    S = input()
    print(S[:-8])
if __name__ == "__main__":
    main()

Solution (Python):
s = input()
print(s[:-8])

Solution (Python):
s = input()
ans = s[:-8]
print(ans)

Solution (Python):
print(input()[:-8])

Solution (Python):
s=input()
print(s[:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
s=input()
print(s[:-8])

Solution (Python):
def main():
    s = input()
    print(s[:-8])
if __name__ == '__main__':
    main()

Solution (Python):
S = input()
print(S[:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
s=str(input())
print(s[:-8])

Solution (Python):



from fractions import gcd
from itertools import combinations,permutations,accumulate 

from collections import deque,defaultdict,Counter
import decimal
import re











import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
S = input()
print(S[:len(S)-8])

Solution (Python):
S = list(input())
N = len(S)
ans = S[:N-8]
ans = ''.join(ans)
print(ans)

Solution (Python):
s = str(input())
print(s[0:len(s)-8])

Solution (Python):
S = input()
print(S[:len(S)-8])

Solution (Python):
s = input()
print(s[:-8])

Solution (Python):
S = input().strip()
print(S[:-8])

Solution (Python):
s = input()

print(s[:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
s=input()
print(s[:-len("FESTIVAL")])

Solution (Python):
s = input()
print(s[:len(s)-8])

Solution (Python):
print(input()[:-8])

Solution (Python):


S = input()


s_len = len(S)
ans = S[:(s_len - 8)]


print(ans)

Solution (Python):
S = input()

print(S[:-8])

Solution (Python):
S = input()
print(S[:-8])

Solution (Python):
s = input()
print(s[:-8])

Solution (Python):
print(input().strip()[:-8])

Solution (Python):
import sys
input = sys.stdin.readline
from collections import *

S = input()[:-1]
print(S[:-8])

Solution (Python):
s = input()
print(s[:-8])

Solution (Python):


import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi,factorial
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def SI(): return input().rstrip()
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7
s=SI()
n=len(s)
u=s[0:n-8]
print(u)

Solution (Python):
s=input()
n=len(s)
a=[]
for i in range(n-8):
  a.append(s[i])
print(''.join(a))

Solution (Python):
s  = str(input())
print(s[0:len(s)-8])

Solution (Python):
S = input()
print(S[:-8])

Solution (Python):
s=input()
print(s[:len(s)-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7


S = input()
print(S[:-8])

Solution (Python):
s=input()
S=s[:-8]
print(S)

Solution (Python):
print(input()[:-8])

Solution (Python):
s = list(input())
del s[-1]
del s[-1]
del s[-1]
del s[-1]
del s[-1]
del s[-1]
del s[-1]
del s[-1]
print(''.join(s))

Solution (Python):
S = input()
print(S[:-8])

Solution (Python):
S=input()
print(S[:-8])

Solution (Python):
s = input()
print(s[:-8])

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    s = input()
    print(s[:-8])

if __name__ == '__main__':
    resolve()

Solution (Python):
s = input()
print(s[:-8])

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7


def input():
    return sys.stdin.readline().strip()


def main():
    S = input()
    print(S[:-8])


if __name__ == "__main__":
    main()

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7


def input():
    return sys.stdin.readline().strip()


def main():
    S = input()
    print(S[:-8])


if __name__ == "__main__":
    main()

Solution (Python):
s = input()
print(s[0:len(s)-8])

Solution (Python):
s = input()
print(s[:len(s)-8])

Solution (Python):
s = input()
i = 0
while 1:
    if s[i:] == "FESTIVAL":
        break
    i += 1
print(s[: i])

Solution (Python):
from sys import stdin
import math
import re
import queue

input = stdin.readline

MOD = 1000000007
INF = 122337203685477580

def solve():
    S = (input().rstrip())
    print(S[:len(S)-8])
   


if __name__ == '__main__':
    solve()

Solution (Python):
print(input()[:-8])

Solution (Python):
S=input()
print(S[::-1].replace("FESTIVAL"[::-1],"",1)[::-1])

Solution (Python):
S=input()
print(S[:len(S)-8])

Solution (Python):

import sys

import fractions
import copy
import bisect
import math
import numpy as np
import itertools
from itertools import combinations_with_replacement


from operator import itemgetter
from sys import stdin

from operator import mul
from functools import reduce
from collections import Counter





j=0
k=0
n=3
r=1
a=[0]






"1行1つの整数を入力を取得し、整数と取得する"




"12 21 332 とか入力する時に使う"
"1行に複数の整数の入力を取得し、整数として扱う"

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''

for i in number_list:
    print(number_list[i-1])

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''

'''
x=[]
y=[]
for i in range(N):
    x1, y1=[int(i) for i in input().split()]
    x.append(x1)
    y.append(y1)
print(x)
print(y)
"複数行に2数値を入力する形式 x座標とy座標を入力するイメージ"
'''

'''
mixlist=[]
for i in range(N):
    a,b=input().split()
    mixlist.append((int(a),b))
print(mixlist)
"複数行にintとstrを複合して入力するやつ，今回はリスト一つで処理している"
'''

'''



"正方行列にstr型の値を入力"
'''




'''
入力
1 2
4 5
7 8
出力結果
[[1, 2], [4, 5], [7, 8]]
'''
"列数に関して自由度の高いint型の値を入力するタイプの行列"


'''
table = [[int(i) for i in input().split()] for m in range(m)]

print(type(N))
print(N)
print(type(M))
print(M)

print(type(table))
print(table)
'''











'''
入力
1234
出力
1
[[1, 2, 3, 4]]
'''




'''
word_list= input().split(" ")
print(word_list[0])
"連続文字列の入力"
"qw er ty とかの入力に使う"
"入力すると空白で区切ったところでlistの番号が与えられる"
'''



'''
A, B, C=stdin.readline().rstrip().split()
print(A)
"リストではなく独立したstr型を入れるなら以下のやり方でOK"
'''




"aという変数に入っているものを大文字にして出力"

















'''
コンビネーションの組み合わせの中身を出力する形式
for i in itertools.combinations(brray, 2)
combinationsをpermutationsにすれば順列になる
今回なら(abc133B)
入力
1 2
5 5
-2 8
出力
[[1, 2], [5, 5], [-2, 8]]
もちろん一次元リストでも使えるし
何よりiもリストのように使えるので便利
'''


'''
def cmb(n,r):
    
    r= min(n-r,r)
    
    if r == 0: return 1
    over = reduce(mul, range(n, n-r, -1))
    
    
    

    under = reduce(mul, range(1, r+1))
    
    
    
    

    return over // under
    
    
    
    
a = cmb(n, r)

'''

'''
import itertools
from itertools import combinations_with_replacement

combinationについて
以下の違いを意識しよう
combinations() p, r 長さrのタプル列、ソートされた順で重複なし

combinations_with_replacement() p, r 長さrのタプル列、ソートされた順で重複あり


使用例 　　　　　　　　　　　                  出力　　
combinations('ABCD', 2)　　　　　　　　　　　　AB AC AD BC BD CD

combinations_with_replacement('ABCD', 2)　　 AA AB AC AD BB BC BD CC CD DD
'''



'''




for i in a.most_common(n):print(i)





 


'''









'''
bisect.bisect_left(a, x, lo=0, h=len(a))
引数
a: ソート済みリスト
x: 挿入したい値
lo: 探索範囲の下限
hi: 探索範囲の上限
(lo, hiはスライスと同様の指定方法)
bisect_leftはソートされたリストaに対して順序を保ったままxを挿入できる箇所を探索します。leftが示す通り、aにすでにxが存在している場合は、挿入箇所は既存のxよりも左側になります。また、lo, hiを指定することで探索範囲を絞り込むことも可能です。デフォルトはaの全体が探索対象です。
'''

'''
素数の判定
'''


def is_prime(n):
    if n == 1: return False

    for k in range(2, int(np.sqrt(n)) + 1):
        
        if n % k == 0:
            return False
            
    return True


'''
npのmaxとmaximumの違い
xs = np.array([1, -2, 3])
np.max(xs, 0)
この出力は3となります．[1, -2, 3]と0の4つの数字のうち，最も大きい値を出力します．

一方で，[max(1, 0), max(-2, 0), max(3, 0)]を出力したい時があります．
その時は，numpyのmaximum関数を用います．

xs = np.array([1, -2, 3])
np.maximum(xs, 0)  

'''

def factorial(x, mod=10**9+7):
    
    
    
    tmp = 1
    for i in range(1, x+1):
        tmp = (tmp * i) % mod
    return tmp
    '''
    Basically, when you do a**d % n, you actually have to calculate a**d, which could be quite large.
    But there are ways of computing a**d % n without having to compute a**d itself, and that is what pow does.
    '''











'''
ascii_letters = 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
digits = '0123456789'
hexdigits = '0123456789abcdefABCDEF'
letters = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuv...\xaf\xb0...
lowercase = 'abcdefghijklmnopqrstuvwxyz'
octdigits = '01234567'
printable = '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTU...
punctuation = '!"
uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
whitespace = '\t\n\x0b\x0c\r '
'''
def main():
    n=3
    steps=0
    state=0
    w=1
    j=0
    k=0
    
    
    
    
    
    
    s=input()
    a=[i for i in s]
    print(''.join(a[:-8]))
    
    
    


    for i in range(1,n+1,2):
     pass
     

    l = ['aaa', 'bbb', 'ccc']
    x=l.index('aaa')
    
    
    
    

    
        
    
    

    
    
    
    
    DP = np.zeros(w+1, dtype=int)
    exdp=np.zeros((3,4)) 
    
    
    
        
        
    
    
        
        
    


    
    



    '''
    入力
    1234
    出力
    [1, 2, 3, 4]
    '''
    pin_l=["x" for i in range(10)]
    

    ls = ["a", "b", "c", "d", "e"]


    
    

    
    

    
    
    
    
    
    '''
    lsというリストの場合に、1つ飛びの値を取得したい場合には
    ls[::2]
    のようにします。こうすると、
    ["a", "c", "d"]と出力される
    '''

if __name__ == "__main__":
    main()

Solution (Python):
print(input()[:-8])

Solution (Python):
S = input()
print(S[:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
s = input()
print(s[0:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    s=input()
    print(s[:-8])
resolve()

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    
    s=str(input())
    print(s[:-8])

    
resolve()

Solution (Python):
s = input()
print(s[:-8])

Solution (Python):
s=input()
print(s[:len(s)-8])

Solution (Python):
s = input()
print(s[:-8])

Solution (Python):
s = list(str(input()))
del s[:-9:-1]
print(''.join(s))

Solution (Python):
print(input()[:-8])

Solution (Python):
s = input()
s = s[:-8]
print(s)

Solution (Python):
s = input()
print(s[:len(s)-8])

Solution (Python):
S = input()
print(S[:-8])

Solution (Python):

s = input()

print(s[:len(s)-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
S=input()
print(S[:-8])

Solution (Python):
a=input()
print(a[0:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
s = input()

print(s[:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
s = input()
print(s[:-8])

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

    s = input().rstrip()
    print(s[:-8])

if __name__ == '__main__':
    main()

Solution (Python):
s = input()
print(s[: len(s) - 8])

Solution (Python):
s=input()
print(s[:len(s)-8])

Solution (Python):
s = input()
print(s[:-8])

Solution (Python):
S = input()

print(S[:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    s=input()
    print(s[:-8])

if __name__=='__main__':
    main()

Solution (Python):
S=input()
print(S[:-8])

Solution (Python):
s = input()
res = s[:-8]
print(res)

Solution (Python):
s=input()
a=len(s)-8
print(s[0:a])

Solution (Python):
s=input()
print(s[:-8])

Solution (Python):
s = input()

print(s[:-8])

Solution (Python):
a=input()
print(a[:-8])

Solution (Python):
s=input()
print(s[:-8])

Solution (Python):
s = input()

for i in range(len(s) - 8):
    print(s[i] ,end="")
print()

Solution (Python):
s = input()
print(s[:-8])

Solution (Python):
s = input()
print(s[0:len(s)-8])

Solution (Python):
S = input()
print(S[:len(S) - 8])

Solution (Python):
S=input()
print(S[0:len(S)-8])

Solution (Python):
s=input()
print(s[:-8])

Solution (Python):
S = input()
c='FESTIVAL'
ans = S[:-len(c)]
print(ans)

Solution (Python):
S = input()
print(S[:-8])

Solution (Python):
S = input()
ls = len(S)
for i in range(ls - 8):
    print(S[i], end="")

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

s = input()
print(s[:len(s) - 8])

Solution (Python):
S=list(str(input()))

for i in range(8):
    S.pop()
S=''.join(S)
print(S)

Solution (Python):

s = input()
print(s[:-8])

Solution (Python):
s = input()
print(s[:-8])

Solution (Python):
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

def lcm(x, y):
    return (x * y) // math.gcd(x, y)

if __name__ == '__main__':
    s =input()
    print(s[:len(s)-8])

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = 1e10


def solve():
    s = S()
    print(s[:-8])
    return



if __name__ == '__main__':
    solve()

Solution (Python):
s = input()
print(s[:len(s)-len('FESTIVAL')])

Solution (Python):
S = input()
print(S[:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
s=input()
s=s[:-8]
print(s)

Solution (Python):
S = input()
print(S[:-8])

Solution (Python):
s = input()
print(s[:len(s)-8])

Solution (Python):
print(input()[:-8])

Solution (Python):

S = input()
print(S[0:len(S)-8])

Solution (Python):
S = input()

print(S[:(len(S)-8)])

Solution (Python):
s=input()
print(s[:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
s = list(input())
del s[-8:]
print(*s, sep="")

Solution (Python):
print(input()[:-8])

Solution (Python):
l = list(input())

print("".join(l[:len(l)-8]))

Solution (Python):
def main():
    print(input()[:-8])


if __name__ == '__main__':
    main()

Solution (Python):
s = input()

print(s[0:-8])

Solution (Python):
s = input()
print(s[:-8])

Solution (Python):
def main():
    S = input()
    print(S[:-8])


if __name__ == '__main__':
    main()

Solution (Python):
s = input()

ans = s[:-8]
print(ans)

Solution (Python):
print(input()[:-8])

Solution (Python):
l = input()
print(l[:-8])

Solution (Python):
S = input()
FES = 'FESTIVAL'
l = len(S) - len(FES)

r = ''
for i in range(l):
    r += S[i]
print(r)

Solution (Python):
S = input()

ans = S[:-8]
print(ans)

Solution (Python):
x=input()
t=len(x)
print(x[0:(t-8)])

Solution (Python):
s = input()
print(s[:-8])

Solution (Python):
def main():
    s = input().rstrip()
    print(s[:-8])

if __name__ == "__main__":
    main()

Solution (Python):
s = input()

print(s[:-8])

Solution (Python):









import sys



ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)

def main():
    s = input()
    l = len(s)
    print(s[0:(l-8)])

if __name__ == '__main__':
    main()

Solution (Python):
S=input()
print(S[:len(S)-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
s=input()
print(s[:len(s)-8])

Solution (Python):
S = input()
K = S[0:-8]
print(K)

Solution (Python):
print(input()[:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
s=input()
for x in range(len(s)-8):print(s[x],end='')

Solution (Python):
print(input()[:-8])

Solution (Python):
s=input()
s_len=len(s)
print(s[:s_len-8])

Solution (Python):
s = input()
print(s[:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
S = input()
index = 'FESTIVAL'
f = S[::-1].find(index[::-1])
ans = S[::-1]
ans = ans[f+8:]
print(ans[::-1])

Solution (Python):
print(input()[:-8])

Solution (Python):


s = input()
print(s[:len(s) - 8])

Solution (Python):
S = input()
print(S[0 : len(S) - 8])

Solution (Python):
print(input()[:-8])

Solution (Python):
from sys import stdin
S = stdin.readline().rstrip()
len_S = len(S)
print(S[:len_S - 8])

Solution (Python):
print(input()[:-8])

Solution (Python):
S = input()
print(S[:len(S) - 8])

Solution (Python):
s=input()
print(s[:-8])

Solution (Python):
s = input()

print(s[:len(s)-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
s = input()

print(s[:-8])

Solution (Python):
def examA():
    S = SI()
    F = "FESTIVAL"
    ans = S[:-(len(F))]
    print(ans)
    return

def examB():
    ans = 0
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
alphabet = [chr(ord('a') + i) for i in range(26)]

if __name__ == '__main__':
    examA()

"""

"""

Solution (Python):
s = input()
l = len("FESTIVAL")
print(s[:-l])

Solution (Python):
import math
import decimal
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

class Library():
    @staticmethod
    def Swap(a,b):
        return [b,a]

    @staticmethod
    def myRound(a,dig=0): 
        p = 10 ** dig
        return (a * p * 2 + 1) // 2 / p

    @staticmethod
    def Roundup(a,dig=0): 
        if a < 0:
            return int(a)
        else:
            return int(a + 0.9)

    @staticmethod
    def Gcd(a,b): 
        if (a<b):
            a,b = Library.Swap(a,b)
        if (b==0):
            return a
        else:
            return Library.Gcd(b,a%b)

    @staticmethod
    def Lcm(a,b): 
        return a//Library.Gcd(a,b)*b

    @staticmethod
    def Divisors(a): 
        divisors = []
        for i in range(1,int(a**0.5)+1):
            if a%i==0:
                divisors.append(i)
                if i!=a//i:
                    divisors.append(a//i)
        divisors.sort()
        return divisors

class Prime():
    
    
    def __init__(self,num):
        self.num = num
        self.sieve = [0 for i in range(self.num + 1)]
        self.sieve[0] = -1
        self.sieve[1] = -1
        for i in range(2,self.num + 1):
            if self.sieve[i] == 0:
                self.sieve[i] = i
                for j in range(i + i,self.num + 1,i):
                    if self.sieve[j]:
                        self.sieve[j] = i
    
    
    def isPrime(self,num = None):
        if num is None:
            num = self.num
        if self.sieve[num] == num:
            return True
        else:
            return False
    
    
    def PrimeNum(self,num = None):
        if num is None:
            num = self.num
        prime = []
        for i in range(2,num):
            if self.sieve[i] == i:
                prime.append(i)
        return prime
    
    
    def PrimeFact(self,num = None):
        if num is None:
            num = self.num
        fact = []
        cnt = 0
        while self.sieve[num] != 1:
            fact.append(self.sieve[num])
            num //= self.sieve[num]
        return fact

def main():
    s = input()
    t = s[0:-8]
    print(t)
    return

if __name__=='__main__':
    main()

Solution (Python):
s=input()

print(s[:-8])

Solution (Python):
def main():
    S = input()
    S = S[:-8]
    print(S)

if __name__ == '__main__':
    main()

Solution (Python):
from sys import stdin

s = stdin.readline().rstrip()

print(s[:-8])

Solution (Python):
s=input()
print(s[0:(s.rfind('FESTIVAL'))])

Solution (Python):
print(input()[:-8])

Solution (Python):
def main(s: str):
    print(s[:-8])


if __name__ == "__main__":
    s = input()

    main(s)

Solution (Python):
print(input()[:-8])

Solution (Python):


S = input()

print(S[:-8])

Solution (Python):

 
import math
import itertools
import sys
import copy
 





S = str(input())

print (S[:len(S)-8])

Solution (Python):
s = input()
print(s[:-8])

Solution (Python):
S = input()
print(S[:-8])

Solution (Python):
print(input()[:-len('FESTIVAL')])

Solution (Python):
print(input()[:-len('FESTIVAL')])

Solution (Python):
s = input()

answer = ""
for i in range(len(s)-8):
  answer = answer + s[i]
  
print(answer)

Solution (Python):
a = input()
if a.endswith('FESTIVAL'):
  print(a[-len(a):-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
S = input()
print(S[:-8])

Solution (Python):
S=input()
print(S[:-8])

Solution (Python):
S = input()
print(S[:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
S = input()
print(S[:-8])

Solution (Python):
S = input().strip()
print(S[:-8])

Solution (Python):
S = input()
print(S[:-8])

Solution (Python):
print(input()[0:-8])

Solution (Python):
s = input()

print( s[:len(s)-8] )

Solution (Python):
s=input()
print(s[:-8])

Solution (Python):


s=input()
n=len(s)
print(s[:n-8])

Solution (Python):
S = input()
print(S[:-8])

Solution (Python):
s = input()
print (s[:-8])

Solution (Python):
s = input()
print(s[:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
print(input()[:-8:])

Solution (Python):
s=input()
print(s[:len(s)-8])

Solution (Python):
s = input()
print(s[:-8])

Solution (Python):
print(input()[:-len('Festival')])

Solution (Python):

s = input()
n = len('FESTIVAL')
print(s[:len(s)-n])

Solution (Python):
s = input()
print(s[:len(s)-8])

Solution (Python):
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    s = str(readline().rstrip().decode('utf-8'))
    print(s[:-8])


if __name__ == '__main__':
    solve()

Solution (Python):
print(input()[:-8])

Solution (Python):
S = str(input())
X = len(S)

ans = S[:X-8]
print(ans)

Solution (Python):
print(input()[:-8])

Solution (Python):
s = input()
print(s[:(len(s)-8)])

Solution (Python):
S = input()

print(S[0:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):

S = input()
n = len(S)
S1 = S[0:n-8]
print(S1)

Solution (Python):
print(input()[:-8])

Solution (Python):
S = input()
print(S[:-8])

Solution (Python):
s = input()

print(s[:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):

s = input()
print(s[:-8])

Solution (Python):
s=list(input())
ans=''
for i in range(len(s)-8):
    ans+=s[i]
print(ans)

Solution (Python):

import sys
sys.setrecursionlimit(10000)
INF = 1<<32


def solve(S: str):
    print(S[:len(S)-8])
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    solve(S)

if __name__ == '__main__':
    main()

Solution (Python):
S = input()
print(S[:(len(S)-8)])

Solution (Python):
s = input()
print(s[:len(s)-8])

Solution (Python):
s=input()
print(s[:-8])

Solution (Python):
list1 = list(input())
del list1[-8:]
print("".join(list1))

Solution (Python):
S=input()
for i in range(len(S)-8):
  print(S[i],end="")
print()

Solution (Python):
s=input()
print(s[0:len(s)-8])

Solution (Python):
s = str(input())
print(s[:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
print(str(input())[:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
print(input()[:-8])

Solution (Python):
s = input()

l = len(s) - 8

print(s[:l])