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



Sample input:
CODEFESTIVAL


Sample output:
CODE

Submission status: Wrong Answer

Solution code:
print(input()[:-9])

Submission status: Wrong Answer

Solution code:
S = input()
S = S.replace("FESTIVAL","")
print(S)

Submission status: Wrong Answer

Solution code:
s = input()
print(s.replace('FESTIVAL', '', 1))

Submission status: Wrong Answer

Solution code:
print(input()+"FESTIVAL")

Submission status: Wrong Answer

Solution code:
print(input().replace("FESTIVAL",""))

Submission status: Wrong Answer

Solution code:
s=input()
s=s.replace("FESTIVAL","")
print(s)

Submission status: Wrong Answer

Solution code:
print(input().replace("FESTIVAL","",1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()
s = s[:-8]
s

Submission status: Wrong Answer

Solution code:
s = input()
s = s.split('FESTIVAL')[0]
s

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

# A - XXFESTIVAL
s = input()

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

Submission status: Wrong Answer

Solution code:
S=input()
print(S.replace("FESTIVAL",""))

Submission status: Wrong Answer

Solution code:
S=list(input())
list_=['FESTVAL']
ans=list(set(S)-set(list_))
print(ans)

Submission status: Wrong Answer

Solution code:
S=input()
print(S.replace('FESTIVAL','',1))

Submission status: Wrong Answer

Solution code:
print(input().replace("FESTIVAL", "", 1))

Submission status: Wrong Answer

Solution code:
print(input().replace('FESTIVAL',''))

Submission status: Wrong Answer

Solution code:
S = input()
K = S.replace("FESTIVAL","")
print(K)

Submission status: Wrong Answer

Solution code:
s=input()
for x in range(len(s)-8):print(s[x])

Submission status: Wrong Answer

Solution code:
from sys import stdin

s = stdin.readline().rstrip()

print(s[:-9])

Submission status: Wrong Answer

Solution code:
print(input()[:8])

Submission status: Wrong Answer

Solution code:
print(input()[len('FESTIVAL'):])

Submission status: Wrong Answer

Solution code:
# 2019/12/13

print(input().replace('FESTIVAL',''))

Submission status: Wrong Answer

Solution code:
print(input().replace("FESTIVAL", "", 1))

Submission status: Wrong Answer

Solution code:
print(input().replace("FESTIVAL", ""))

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000)
INF = 1<<32


def solve(S: str):
    print(S[:S.index('FESTIVAL')]+S[S.index('FESTIVAL')+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)  # type: str
    solve(S)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
s = input()
print(s[:len(s)-7])

Submission status: Wrong Answer

Solution code:
s = input()
print(s[:len(s)-6])

Submission status: Wrong Answer

Solution code:
s = str(input())
print(s.replace('FESTIVAL',''))

Submission status: Wrong Answer

Solution code:
s = input()
print(s[:len(s)-4])

Submission status: Wrong Answer

Solution code:
s = input()
print(s[:len(s)-4])

Submission status: Wrong Answer

Solution code:
s=input()
print(s.replace("FESTIVAL",""))

Submission status: Wrong Answer

Solution code:
S = input()
print(S[0:len(S)-7])

Submission status: Wrong Answer

Solution code:
S = input()
print(S.replace("FESTIVAL", ""))

Submission status: Wrong Answer

Solution code:
s = input()
print(s[:-9])

Submission status: Wrong Answer

Solution code:
s = input().rstrip()
print(s[:-9])

Submission status: Wrong Answer

Solution code:
s = input()
print(s[:-9])

Submission status: Wrong Answer

Solution code:
string = str(input())
string = string.split("FESTIVAL")
print(string[0])

Submission status: Wrong Answer

Solution code:
s = input()
Ss = s.split("FESTIVAL")
print("".join([i if i!="" else "FESTIVAL" for i in Ss[:-1]]))

Submission status: Wrong Answer

Solution code:
s= input()
print(s[:-7])

Submission status: Wrong Answer

Solution code:
s= input()
print(s[:-6])

Submission status: Wrong Answer

Solution code:
title = input().split('FESTIVAL')
print(title)

Submission status: Wrong Answer

Solution code:
s = input()
print(s[:-7])

Submission status: Wrong Answer

Solution code:
print(input().replace('FESTIVAL', ''))

Submission status: Wrong Answer

Solution code:
s=input()
print(s[:-7])

Submission status: Wrong Answer

Solution code:
s=input().rstrip()
print(s.replace('FESTIVAL',''))

Submission status: Wrong Answer

Solution code:
def main():
    s = input()
    s = s.replace("FESTIVAL", "")
    print(s)

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
print(input().rstrip('FESTIVAL'))

Submission status: Wrong Answer

Solution code:
x=input()

y='FESTIVAL'

print(x.rstrip(y))

Submission status: Wrong Answer

Solution code:
x=input()

y='FESTIVAL'

print(x.replace(y,''))

Submission status: Wrong Answer

Solution code:
x=input()

y='FESTIVAL'

print(x.replace(y,''))

Submission status: Wrong Answer

Solution code:

x=input()

y='FESTIVAL'

print(x.rstrip(y))

Submission status: Wrong Answer

Solution code:
print raw_input()[:-7]

Submission status: Wrong Answer

Solution code:
s=input()
print(s[:-7])

Submission status: Wrong Answer

Solution code:
S = input()
tmp = S[::-1]
s = "FESTIVAL"
S = tmp.split(s[::-1])
print(S[1][::-1])

Submission status: Wrong Answer

Solution code:
a = input().rstrip().split("FESTIVAL")[0]
print(a)

Submission status: Wrong Answer

Solution code:
#!usr/bim/python
#! -*- coding: utf-8 -*-

s = raw_input()

ans = s[:8]

print ans

Submission status: Wrong Answer

Solution code:
S = input()
print(S.replace('FESTIVAL',''))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()

i = S.find('FESTIVAL')

print(S[:i])

Submission status: Wrong Answer

Solution code:
print(input().split("FESTIVAL")[0])

Submission status: Wrong Answer

Solution code:
s=input()
print(s[:-9])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
s=input()
print(s[:-8])

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
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)]

# nまでの自然数が素数かどうかを表すリストを返す
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()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
def input():
    return sys.stdin.readline()[:-1]

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
'''
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()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#CODE FESTIVAL 2017 qual B a
s=input()
n=len(s)-len("FESTIVAL")
ans=""
for i in range(n):
    ans+=s[i]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

print(s[:-8])

Submission status: Accepted

Solution code:
n = input()

print(n[:-8])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:


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()

Submission status: Accepted

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

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

print(s[:-8])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations,permutations,accumulate # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Counter
import decimal
import re
#import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
S = input()
print(S[:len(S)-8])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Problem A - XXFESTIVAL
# input
S = input()

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

# output
print(ans)

Submission status: Accepted

Solution code:
S = input()

print(S[:-8])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
from collections import *

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

Submission status: Accepted

Solution code:
#float型を許すな
#numpyは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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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#, log2
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
#from decimal import *

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys

import fractions
import copy
import bisect
import math
import numpy as np
import itertools
from itertools import combinations_with_replacement
#import math#数学的計算はこれでいける。普通に0.5乗しても計算可能
#w=input()
from operator import itemgetter
from sys import stdin
#input = sys.stdin.readline#こっちの方が入力が早いが使える時に使っていこう
from operator import mul
from functools import reduce
from collections import Counter
#from collections import deque

#input = stdin.readline


j=0
k=0
n=3
r=1
a=[0]
#n=int(input())
#r=int(input())
#print(M)
#A=int(input())
#B=int(input())
#print(N)
"1行1つの整数を入力を取得し、整数と取得する"


#number_list=list(map(int, input().split(" ")))#数字の時
#print(number_list)
"12 21 332 とか入力する時に使う"
"1行に複数の整数の入力を取得し、整数として扱う"

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''
#メモ
for i in number_list:#こっちの方がrage使うより早いらしい
    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を複合して入力するやつ，今回はリスト一つで処理している"
'''

'''
#array=[input().split()for i in range(N)]
#print(type(array[0][0]))
#print(array)
"正方行列にstr型の値を入力"
'''

#brray=[list(map(int, input().split(" ")))for i in range(N)]
#print(type(brray[0][0]))
#print(brray)
'''
入力
1 2
4 5
7 8
出力結果
[[1, 2], [4, 5], [7, 8]]
'''
"列数に関して自由度の高いint型の値を入力するタイプの行列"
#以下に別解を記載
#N, M = [int(i) for i in input().split()]
'''
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)
'''




#s=input()
#a=[int(i) for i in s]
#print(a[0])
#print([a])
#単数値．桁ごとに分割したい．入力と出力は以下の通り
#イメージとして1桁ごとにリストに値を入れているかんじ
#intを取ると文字列分解に使える
'''
入力
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()#str style 何個でもいけることが多い
print(A)
"リストではなく独立したstr型を入れるなら以下のやり方でOK"
'''


#a= stdin.readline().rstrip()
#print(a.upper())
"aという変数に入っているものを大文字にして出力"


#a,b=map(int, input().split())  #int style 複数数値入力　「A B」みたいなスペース空いた入力のとき

#なんかうまく入力されるけど
#a=[[int(i) for i in 1.strip()]for 1 in sys.stdin]
#a = [[int(c) for c in l.strip()] for l in sys.stdin]]
#print(a)
#複数行の数値を入力して正方行列を作成


##############################################################################################
##############################################################################################
#under this line explains example calculation



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

#nCr combination
'''
def cmb(n,r):
    #When n < r , this function isn't valid
    r= min(n-r,r)
    #print(n,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n-r, -1))
    #flochart mul(n,n-1)=x
    #next     mul(x,n-2)........(n-r+1,n-r)
    #mul read a,b and returns a*b

    under = reduce(mul, range(1, r+1))
    #print(over, under)
    #reduce is applied mul(1,2)=2
    #next   mul(2,3)=6
    #next   mul(6,4)=4.........last(r!,r+1)=r+1!

    return over // under
    #// is integer divide
    #calc example 5C2
    #over=5*4*3
    #under=3*2*1
a = cmb(n, r)
#print(a)
'''

'''
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
'''



'''
#集計
#example
#a=[2,2,2,3,4,3,1,2,1,3,1,2,1,2,2,1,2,1]
#a=Counter(a)
for i in a.most_common(n):print(i)
#most_common()メソッドは、出現回数が多い要素順にCounterオブジェクトを並び替えます。
#引数にint型の数字nを設定した場合は、出現回数が高い上位ｎ個の要素を返します。
#何も設定しなければ、コンテナ型にあるすべての要素を出現回数の順番に並び替えたタプル型オブジェクトを返します。
#out put
#(2, 8)
 #(1, 6)
#(3, 3)
#(4, 1)
'''


#二部探索(binary search)
#A = [1, 2, 3, 3, 3, 4, 4, 6, 6, 6, 6]
#print(A)
#index = bisect.bisect_left(A, 5) # 7 最も左(前)の挿入箇所が返ってきている
#A.insert(index, 5)
#print(index)
#print(A)
'''
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):
        #sqrt(n)+1以上は考えて約数はないので却下
        if n % k == 0:
            return False
            #割り切れたら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)  # [1, 0, 3]

'''

def factorial(x, mod=10**9+7):
    # x!
    # 階乗
    # ex) factorial(5) = 120
    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.
    '''


########################################################################
########################################################################
#b2=a[:]  #1次元のときはコピーはこれで良い
#print(b2)

#a= [[0]*3 for i in range(5)] #2次元配列はこう準備、[[0]*3]*5だとだめ
#b3=copy.deepcopy(a)  #2次元配列はこうコピーする
#print(b3)

'''
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
    #lenを変数に置くと事故るから注意
    #n=int(input())
    #a,b=input().split(" ")#a,bがともに文字列のとき
    #a,b=map(int, input().split(" "))
    #mapでとってもstrで変換すればappend可能
    #nl=list(map(int, input().split(" ")))#数字の時
    s=input()
    a=[i for i in s]#int取るとstrでも行ける
    print(''.join(a[:-8]))
    #print(a)
    #brray=[list(map(int, input().split(" ")))for i in range(N)]
    #print(brray)


    for i in range(1,n+1,2):#これで1個飛ばしループになる
     pass
     #print(i)

    l = ['aaa', 'bbb', 'ccc']
    x=l.index('aaa')#ある要素のインデックス番号を取得
    #s = ''.join(l)
    #s = " ".join(map(str,a))#スペースを空ける時はこう
    #print(s)
    # aaabbbccc

    #if state in known_states and not flag: # state => 2 steps => 5
        #こうやってある要素がリストの中にあるか探すのか
    #print(f'steps: {steps}, state: {state}')
    #こう書いてあるとデバックしやすい

    #dp= [[0]*3 for i in range(5)]#列　行
    #dp用の0の入ったやつ
    #dp= [[0]*(w+1) for i in range(n+1)]#0からwまでのw+1回計算するから
    #print(dp)＃初期条件が入る分計算回数+1列分必要(この場合は判断すべきものの数)
    DP = np.zeros(w+1, dtype=int)#これでも一次元リストが作れる
    exdp=np.zeros((3,4)) # ３×４の２次元配列を生成。2次元ならこう
    #dtypeは指定しないとfloatになる
    #for i in range(n):#ちょっとした入力に便利
    #    a, b = map(int, input().split())
        #dp[i][0] += [a]
        #これだとintとlistをつなぐことになって不適
    #    dp[i] += [a]
    #    dp[i] += [b]
        #これはうまくいく
        #やり方はいろいろあるということ
    #print(dp)


    #brray=[list(map(int, input().split(" ")))for i in range(N)
    #print(brray)



    '''
    入力
    1234
    出力
    [1, 2, 3, 4]
    '''
    pin_l=["x" for i in range(10)]#内包表記に慣れろ
    #print(pin_l)

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


    #print(ls[2:5])
    #スライスでの取得

    #print(ls[:-3])
    #一番左端から右から3番目より左まで取得

    #print(ls[:4:2])
    #スライスで1個飛ばしで取得
    #ないときは左端スタート
    #始点のインデックス番号 : 終点のインデックス番号 : スキップする数+1
    #print(ls[::2])
    '''
    lsというリストの場合に、1つ飛びの値を取得したい場合には
    ls[::2]
    のようにします。こうすると、
    ["a", "c", "d"]と出力される
    '''

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

    
resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - XXFESTIVAL
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    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
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

if __name__=='__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# CODE FESTIVAL 2017 予選 B: A – XXFESTIVAL
s = input()
print(s[:-8])

Submission status: Accepted

Solution code:
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])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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

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


#main
if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A
S = input()
print(S[0:len(S)-8])

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = list(input())

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()

print(s[0:-8])

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S = input()

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