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 Fortran (gfortran v4.8.4) (judge verdict: Accepted)

character(102) S,ans
read*,S
do i=1,len_trim(S)+1
  do j=i,len_trim(S)+1
    if(i==1)then
      ans=trim(S(j+1:))
    else
      ans=S(1:i-1)//S(j+1:)
    end if
    if(trim(ans)=="keyence")then
      print"(A)","YES"
      STOP
    endif
  end do
end do
print"(A)","NO"
end