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 atcoder
    implicit none
    integer(8) :: n,k,i,j
    character(len=7) :: a,b
    character(len=100) :: s
    a = "keyence"
    read*,s
    n = len_trim(s)
    do i = 0,7
        j = 7 - i
        if(i/=0)then
            b(1:i) = s(1:i)
        endif
        if(j/=0)then
            b(7-j+1:7) = s(n-j+1:n)
        endif
        if(b==a)then
            print"(a)","YES"
            stop
        endif
    enddo
    print"(a)","NO"
    stop 
contains


end program atcoder