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.42.0) (judge verdict: Accepted)

#![allow(unused, non_snake_case, dead_code, non_upper_case_globals)]
use {
    proconio::{marker::*, *},
    std::{cmp::*, collections::*, mem::*},
};

fn main() {
    input! {
        mut s:Chars,
    }
    // 7moji ijo
    if s.len() < 7 {
        println!("NO");
        return;
    }

    let n = s.len();
    let rem = n - 7;
    let aaa = vec!['k', 'e', 'y', 'e', 'n', 'c', 'e'];
    for i in 0..n {
        // i文字目からremもじさくじょ
        let mut st = vec![];
        for j in 0..n {
            if (i..i + rem).contains(&j) {
                continue;
            }
            st.push(s[j]);
        }

        if aaa == st {
            println!("YES");
            return;
        }
    }
    println!("NO");
}