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 Rust (1.15.1) (judge verdict: Accepted)

use std::cmp::min;

fn is_keyence(s1: &str, s2: &str) -> bool {
    "keyence".starts_with(s1) && "keyence".ends_with(s2)
}

fn main() {
    let mut line = String::new();
    std::io::stdin().read_line(&mut line).unwrap();
    let s: &str = line.split_whitespace().next().unwrap();
    let len = s.len();
    let res = match (0..(min(len, 7)+1)).find(|&pos| is_keyence(&s[0..pos], &s[(len-7+pos)..len])) {
        Some(_) => "YES",
        None => "NO"
    };
    println!("{}", res)
}