Problem:
Score : 200 points

Problem Statement

A string is called a KEYENCE string when it can be changed to keyence by removing its contiguous substring (possibly empty) only once.

Given a string S consisting of lowercase English letters, determine if S is a KEYENCE string.

Constraints

The length of S is between 7 and 100 (inclusive).

S consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:

S

Output

If S is a KEYENCE string, print YES; otherwise, print NO.

Sample Input 1

keyofscience

Sample Output 1

YES

keyence is an abbreviation of key of science.

Sample Input 2

mpyszsbznf

Sample Output 2

NO

Sample Input 3

ashlfyha

Sample Output 3

NO

Sample Input 4

keyence

Sample Output 4

YES

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {

	public static void main(String[] args) throws IOException {
		BufferedReader input =new BufferedReader (new InputStreamReader (System.in));
		String str = input.readLine( );
		String[] start = {"keyenc", "keyen", "keye", "key", "ke", "k"};
		String[] end = {"e", "ce", "nce", "ence", "yence", "eyence"};

		if(str.startsWith("keyence") || str.endsWith("keyence")) {
			System.out.println("YES");
		}else {
			for(int i=0; i<6; i++) {
				if(str.startsWith(start[i]) && str.endsWith(end[i])) {
					System.out.println("YES");
					break;
				}
				if(i==5) {
					System.out.println("NO");
				}
			}

		}
	}

}