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 Ruby (2.3.3) (judge verdict: Accepted)

n = gets.chomp.split("")
check = 0
if n[0] == "k"
  if n[1] == "e" && n[2] == "y" && n[3] == "e" && n[4] == "n" && n[5] == "c" && n[6] == "e"
    puts "YES"
    exit
  end
  if n[1] == "e" && n[2] == "y" && n[3] == "e" && n[4] == "n" && n[5] == "c" && n[-1] == "e"
    puts "YES"
    exit
  end
  if n[1] == "e" && n[2] == "y" && n[3] == "e" && n[4] == "n" && n[-2] == "c" && n[-1] == "e"
    puts "YES"
    exit
  end
  if n[1] == "e" && n[2] == "y" && n[3] == "e" && n[-3] == "n" && n[-2] == "c" && n[-1] == "e"
    puts "YES"
    exit
  end
  if n[1] == "e" && n[2] == "y" && n[-4] == "e" && n[-3] == "n" && n[-2] == "c" && n[-1] == "e"
    puts "YES"
    exit
  end
  if n[1] == "e" && n[-5] == "y" && n[-4] == "e" && n[-3] == "n" && n[-2] == "c" && n[-1] == "e"
    puts "YES"
    exit
  end
  if n[-6] == "e" && n[-5] == "y" && n[-4] == "e" && n[-3] == "n" && n[-2] == "c" && n[-1] == "e"
    puts "YES"
    exit
  end
else
  if n[-7] == "k" && n[-6] == "e" && n[-5] == "y" && n[-4] == "e" && n[-3] == "n" && n[-2] == "c" && n[-1] == "e"
    puts "YES"
    exit
  end
end
puts "NO"