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 C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>


int main(){
 int test,b,i,n,c,d,sum=0,k,y,e;
char a[10000];
gets(a);

for(i=0;i<strlen(a);i++)
{
    if(a[i]=='k')
    {
        k++;
    }else{
    if(a[i]=='e')
    {
        e++;
    }else{
    if(a[i]=='y')
    {
        y++;
    }else{
    if(a[i]=='n')
    {
        n++;
    }
    else{if(a[i]=='c')
    {{
        c++;
    }}
    }
    }
    }
    }
}
if(k>=1 && n>=1 && e>=3 && c>=1 &&  y>=1 )
{
    printf("YES");
}else{
    printf("No");
}
      return 0;
}