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.Scanner;
public class Main{
	public static void main(String[] args){
		Scanner scan = new Scanner(System.in);
		String a=scan.next();
		int ans=0;
		if(a.indexOf("k")!=-1) {
			if(a.lastIndexOf("eyence")+5>a.indexOf("k")) {
				ans=1;
			}
		}if(a.indexOf("ke")!=-1) {
			if(a.lastIndexOf("yence")+4>a.indexOf("ke")) {
				ans=1;
			}
		}
		if(a.indexOf("key")!=-1) {
			if(a.lastIndexOf("ence")+3>a.indexOf("key")) {
				ans=1;
			}
		}
		if(a.indexOf("keye")!=-1) {
			if(a.lastIndexOf("nce")+2>a.indexOf("keye")) {
				ans=1;
			}
		}
		if(a.indexOf("keyen")!=-1) {
			if(a.lastIndexOf("ce")+1>a.indexOf("keyen")) {
				ans=1;
			}
		}
		if(a.indexOf("keyenc")!=-1) {
			if(a.lastIndexOf("e")>a.indexOf("keyenc")) {
				ans=1;
			}
		}
		if(a.indexOf("keyence")!=-1) {
				ans=1;
		}
		if(ans==1) {
			System.out.println("YES");
		}
		else {
			System.out.println("NO");
		}
		}
	}