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 sample
    implicit none
  
    integer(8) :: i,j,m,n
    real(8)::a,b
    integer(8),allocatable :: x(:),y(:)
    character(len=100)::c !文字列

    read(*,*) c
    j=0
    n=len_trim(c)  !len_trimは空白を無視する、大きめに取って
    if (n==7)then
        if (c=='keyence')then
            write(*,*)'YES'
        else
            write(*,*)'NO'
        end if

        stop
    end if

    if (c(1:7)=='keyence')then
        write(*,*)'YES'
        stop
    end if
    if (c(n-6:n)=='keyence')then
        write(*,*)'YES'
        stop
    end if
    

    do i=1,6
    
        if (c(1:i)//c(n+i-6:n)=='keyence')then
            write(*,*)'YES'
            stop
        
        end if

    end do
    write(*,*)'NO'
  
    stop
end program sample