Problem Description

Ringo-san is trying to participate in a certain festival.

The name of the festival is given as a string $ S $ that ends with FESTIVAL. Output what festival Ringo-san is trying to participate in.

However, the name of the festival is assumed to be a string obtained by appending FESTIVAL exactly once to the end of $ s $. For example, CODEFESTIVAL is the festival of CODE.

Input Format

The input is given from the standard input in the following format:

$ S $

Output Format

Output what festival Ringo-san is trying to participate in.

Sample Input and Output

Sample Input #1

CODEFESTIVAL

Sample Output #1

CODE

Sample Input #2

CODEFESTIVALFESTIVAL

Sample Output #2

CODEFESTIVAL

Sample Input #3

YAKINIKUFESTIVAL

Sample Output #3

YAKINIKU

Notes/Hints

Constraints

• $9 \leq |S| \leq 50$
• $ S $ consists only of uppercase alphabets
• $ S $ ends with FESTIVAL

Sample Explanation 1

This is as described in the problem statement.

Sample Explanation 2

Since this is a string obtained by appending FESTIVAL to the end of CODEFESTIVAL, it is the festival of CODEFESTIVAL.

见题面 Input 部分

见题面 Output 部分