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)

s = gets.chomp
S = s.split('')

if S[0] == 'k' && S[S.size-6] == 'e' && S[S.size-5] == 'y' && S[S.size-4] == 'e' && S[S.size-3] == 'n' && S[S.size-2] == 'n' && S[S.size-1] == 'e'
puts 'YES'
elsif   S[0] == 'k' && S[1] == 'e' && S[S.size-5] == 'y' && S[S.size-4] == 'e' && S[S.size-3] == 'n' && S[S.size-2] == 'c' && S[S.size-1] == 'e'
puts 'YES'
elsif  S[0] == 'k' && S[1] == 'e' && S[2] == 'y' && S[S.size-4] == 'e' && S[S.size-3] == 'n' && S[S.size-2] == 'c' && S[S.size-1] == 'e'
puts 'YES'
elsif S[0] == 'k' && S[1] == 'e' && S[2] == 'y' && S[3] == 'e' && S[S.size-3] == 'n' && S[S.size-2] == 'c' && S[S.size-1] == 'e'
puts 'YES'
elsif S[0] == 'k' && S[1] == 'e' && S[2] == 'y' && S[3] == 'e' && S[4] == 'n' && S[S.size-2] == 'c' && S[S.size-1] == 'e'
puts 'YES'
elsif S[0] == 'k' && S[1] == 'e' && S[2] == 'y' && S[3] == 'e' && S[4] == 'n' && S[5] == 'c' && S[S.size-1] == 'e'
puts 'YES'
elsif S[0] == 'k' && S[1] == 'e' && S[2] == 'y' && S[3] == 'e' && S[4] == 'n' && S[5] == 'c' && S[6] == 'e'
    puts 'YES'
elsif S[S.size-7] == 'k' && S[S.size-6] == 'e' && S[S.size-5] == 'y' && S[S.size-4] == 'e' && S[S.size-3] == 'n' && S[S.size-2] == 'c' && S[S.size-1] == 'e'
    puts 'YES'
else
    puts 'NO'
end