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)

const KEYWORD: &'static str = "keyence";
fn main() {
    let mut s = String::with_capacity(100);
    let _ = std::io::stdin().read_line(&mut s);
    println!("{}", if solve(&s.trim()) { "YES" } else { "NO" });
}

fn solve(s: &str) -> bool {
    if s.starts_with(KEYWORD) || s.ends_with(KEYWORD) {
        return true;
    }
    for head_l in 0..(KEYWORD.len()) {
        if [
            &s[0..head_l],
            &s[s.len() - (KEYWORD.len() - head_l)..s.len()],
        ]
        .join("")
            == KEYWORD
        {
            return true;
        }
    }
    false
}