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: Wrong Answer)

import java.util.*;
import java.math.*;
import java.lang.*;
public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		// 整数の入力
		String str = sc.next();
		int strLength = str.length();
		String expected = "keyence";
		boolean flag =false;

		if(str.indexOf(expected)==0 || str.indexOf(expected)==strLength-7){
			flag =true;
			}



		for (int i = 1; i < 7; i++) {
			if(flag){
				break;
			}
			String forword = expected.substring(0,i);
			String backword= expected.substring(i);
			int resultF = str.indexOf(forword);
			int resultB = str.indexOf(backword);
			
			if(
				(resultF ==0&&(resultB==strLength-backword.length()))
			){
				flag =true;
			}

		}

		if(flag){
				System.out.println("YES" );
				}else{
				System.out.println("NO" );
				}




	}


}