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: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# import bisect
# from collections import Counter, defaultdict, deque
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math

import sys

# import numpy as np

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

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:
from sys import stdin
S = stdin.readline().rstrip()
len_S = len(S)
print(S[:len_S - 8])

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

"""

"""

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

print(s[:-8])

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin

s = stdin.readline().rstrip()

print(s[:-8])

Submission status: Accepted

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

Submission status: Accepted

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


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

    main(s)

Submission status: Accepted

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

S = input()

print(S[:-8])

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
 
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
#N = int(input())
S = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
# 2019/12/13

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

print(S[0:-8])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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)  # type: str
    solve(S)

if __name__ == '__main__':
    main()

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:
list1 = list(input())
del list1[-8:]
print("".join(list1))

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 = str(input())
print(s[:-8])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

l = len(s) - 8

print(s[:l])

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    s = str(input().rstrip('\n'))
    print(s[:-8])


if __name__ == '__main__':
    slove()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
print(s[0:-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:
from sys import stdin

def readString() :
    return  stdin.readline().rstrip()

def solve() :
    S = readString()
    pos = S.rfind('FESTIVAL')
    print(S[:pos])
solve()

Submission status: Accepted

Solution code:
def main():

    # N = int(input())
    # S = input()
    # N, M = map(int, input().split())

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

if __name__ == '__main__':
    print(main())

Submission status: Accepted

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

Submission status: Accepted

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

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:
# coding: utf-8
# Your code here!

import re

S = input()

# print(S)

print(re.sub(r'FESTIVAL$', '', S))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# h,w=map(int,input().split())
s=input()

print(s[:-8])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# code-festival-2017-qualbA - XXFESTIVAL
def main():
    s = input()
    print(s[:-8])


if __name__ == "__main__":
    main()

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
S = input()
print(S[:S.rfind("FESTIVAL")])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")


S =sys.stdin.readline().rstrip()
print(S[:-8])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
###template###
import sys
def input(): return sys.stdin.readline().rstrip()
def mi(): return map(int, input().split())
###template###

S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
A - XXFESTIVAL
https://atcoder.jp/contests/code-festival-2017-qualb/tasks/code_festival_2017_qualb_a

"""
import sys


def solve(S):
    return S[:-8]


def main(args):
    S = input()
    ans = solve(S)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=list(input())
s.reverse()
for i in range(8):
  s.remove(s[0])
S="".join(reversed(s))
print(S)

Submission status: Accepted

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

Submission status: Accepted

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

import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

S=input()

print(S[:-8])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import re
print(re.compile(r'(.+)FESTIVAL$').search(input()).group(1))

Submission status: Accepted

Solution code:
s=input()
print(s[0:s.rfind("FESTIVAL")])

Submission status: Accepted

Solution code:
S = input()

ans = S[:-len("FESTIVAL")]

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=list(input())
print(''.join(s[:-8]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()

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

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:
s = raw_input()
print s[:len(s)-8]

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input().strip()
print(S[:-len('FESTIVAL')])

Submission status: Accepted

Solution code:
s = input()
print(s[:s.rfind("FESTIVAL")])

Submission status: Accepted

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

# CODE FESTIVAL 2017 qual B
# Problem A

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

    print(s[:len(s) - len('FESTIVAL')])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import sys

def getinputdata():

    # 配列初期化
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result





arr_data = getinputdata()

s = arr_data[0][0]


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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def main():
    S = input()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
X = len("FESTIVAL")
ans = S[:-X]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=input()

y='FESTIVAL'

print(x[:-8])

Submission status: Accepted

Solution code:
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
INF = float("inf")


def main():
    print(input()[:-len("FESTIVAL")])


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

S = S[0:-8]

print(S)

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
y=list(raw_input())
y.reverse()
foo=''
for i in range(len(y)):
    foo+=y[i]
    if foo=='LAVITSEF':
        j=i
        break
x=y[j+1:]
x.reverse()
print ''.join(x)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()

fes="FESTIVAL"
#for i in range(len(S),0,-1):
for i in range(len(S)):
    if fes==(S[i:]):
        print(S[:i])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input().strip()
print(a[:-len("FESTIVAL")])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str = input()

print(str[0:len(str) - 8])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

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

Submission status: Accepted

Solution code:
value = input()

print(value[0:len(value)-8])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())
for _ in range(8):
    del s[-1]
    
print("".join(s))

Submission status: Accepted

Solution code:
#!/bin/python

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

Submission status: Accepted

Solution code:
s = input()
a = []
n = 0
for c in s[::-1]:
    n += 1
    if n <= 8:
        continue

    a.append(c)

a = ''.join(a)
print(a[::-1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = raw_input()

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

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-
S = list(input())
l = len(S)
for tmp in reversed(range(len(S))):
    S.pop(tmp)
    if tmp == l-8:
        break
print(''.join(S))

Submission status: Accepted

Solution code:
S = input()
sub = "FESTIVAL"

if sub in S:
  print(S[:-len(sub)])

Submission status: Accepted

Solution code:
S = input()
if S[-8:] == "FESTIVAL":
    print("{}".format(S[0:-8]))

Submission status: Accepted

Solution code:
#!/usr/bin/env python

import sys

line = sys.stdin.readline().strip()
pattern = "FESTIVAL"

if line[len(line)-len(pattern):] == pattern:
    print line[0:len(line)-len(pattern)]
else:
    print line

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n = input()
print (n[0:len(n)-8])

Submission status: Accepted

Solution code:
def main():
    s=str(input())
    l=len(s)
    print(s[:l-8])
    
if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    S = input()
    print(S[0:S.rfind('FESTIVAL')])

Submission status: Accepted

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

"""文字列の最後の8文字を除いた部分を返す関数を作成する"""

def main():
    input_s = input()
    print(input_s[:-8])
    return None

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s=input()
print(s[:s.rfind("FESTIVAL")])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    S = input()
    tmp = len(S) - 8
    print(S[:tmp])

Submission status: Accepted

Solution code:
s = raw_input().strip()
print s[:-8]

Submission status: Accepted

Solution code:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-

S = input()

A = S[0:-8]

print(A)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python

from sys import stdin, stderr

def main():
   S = stdin.readline().strip()
   print S[:-8]
   return 0

if __name__ == '__main__': main()

Submission status: Accepted

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

s = raw_input()

ans = s[:-8]

print ans

Submission status: Accepted

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

import sys

a = raw_input()
print a[0:len(a) - 8]

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

n=len(s)

s = s[:n-8]

print(s)

Submission status: Accepted

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

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

print(a[:-8])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import array
from bisect import *
from collections import *
import fractions
import heapq 
from itertools import *
import math
import re
import string

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

Submission status: Accepted

Solution code:
s = input()
print(s[:s.rfind("FESTIVAL")])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

x = S[:-8]

print(x)

Submission status: Accepted

Solution code:
n = input()

print(n[0:-8])

Submission status: Accepted

Solution code:
A=raw_input()
print A[:-8]

Submission status: Accepted

Solution code:
S = input();

print(S[0:-8])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
i = s.rfind("FESTIVAL")
print(s[:i])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-



def main():
    S = input()

    print(S[:-8])

if __name__ == "__main__": main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inputs = input()

print(inputs[:-8])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = raw_input()

print a[:-8]

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# encoding:utf-8

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

if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:



S  = input()

print(S[:-8])

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()

def main():
    s = S()

    return s[:-8]


print(main())

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# Copyright (C) 2017 Sayutin Dmitry.
#
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License as
# published by the Free Software Foundation; version 3
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; If not, see <http://www.gnu.org/licenses/>.

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

main()

Submission status: Accepted

Solution code:
from sys import stdin
#FESTIVAL
print stdin.readline().strip()[:-8]

Submission status: Accepted

Solution code:
# def makelist(n, m):
#     return [[0 for i in range(m)] for j in range(n)]

# n = int(input())
# a, b = map(int, input().split())
# s = input()



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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()


s = s[:-8]

print(s)

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
        main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys,copy,math,heapq,itertools as it,fractions,re,bisect,collections as coll

print raw_input()[:-8]

Submission status: Runtime Error

Solution code:
s=input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
import sys
N=int(input())
D = list(map(int, input().split()))
M=int(input())
T = list(map(int, input().split()))
new_D=sorted(D)
new_T=sorted(T)
#print(new_D[0])
for i in range(1,200000):
    if new_D.count(i)<new_T.count(i):
        print("NO")
        sys.exit()
    
    
print("YES")

Submission status: Runtime Error

Solution code:
from collections import*
i = eval("Counter(list(map(int, input().split()))),"*4)
print("YNEOS"[i[3]-i[1] != {}::2])

Submission status: Runtime Error

Solution code:
S=input()
print(S-"FESTIVAL")

Submission status: Runtime Error

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

n,m= map(int, input().split())
a= [list(map(int, input().split())) for i in range(m)]

b = [[] for i in range(n)]

for i in range(m):
    b[a[i][0]-1].append(a[i][1]-1)
    b[a[i][1]-1].append(a[i][0]-1)

import collections
from collections import deque

INF = -10 ** 9
dis = [INF for i in range(n)]
def bfs(s):
    d = deque()
    d.append(s)
    dis[s]=0
    flag = True

    while len(d):
        x = d.popleft()

        for i in range(len(b[x])):
            y=b[x][i]
            if dis[y] == INF:
                d.append(y)
                dis[y]=dis[x]+1
            else:
                if dis[y]%2!=dis[x]%2:
                    continue
                else:
                    flag=False
    return flag
q=bfs(0)
if q:
    v=0
    w=0
    for i in range(n):
        if dis[i]%2==0:
            v+=1
        else:
            w+=1
    print(v*w-m)

else:
    print(n*(n-1)//2-m)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=int(input())
dp=input().split()
m=int(input())
tp=input().split()
d=dict()

ans="YES"

for di in dp:
    if di in d:
        d[di]+=1
    else:
        d[di]=1

for ti in tp:
    if ti not in dp or d[ti]==0:
        ans="NO"
        break
    else:
        d[ti]-=1
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = input()

print(s[:-8])