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)

program keyence
  implicit none
  character(len=100)::s
  character(len=7)::ke='keyence'
  integer :: i, k
  read(*,*) s
  s=trim(s)
  k=len_trim(s)

  do i = 1, 6
     if ( s(1:i)==ke(1:i) .and. s(k+i-6:k)==ke(i+1:7)) then
        write(*,*) 'YES'
        stop
     end if
  end do

  if ( s(1:7) == ke .or. s(k-6:k) == ke ) then
     write(*,*) 'YES'
     stop
  end if

  write(*,*) 'NO'
  
  stop
end program keyence