{"raw_statement":[{"iden":"problem statement","content":"A string is called a KEYENCE string when it can be changed to `keyence` by removing its contiguous substring (possibly empty) only once.\nGiven a string $S$ consisting of lowercase English letters, determine if $S$ is a KEYENCE string."},{"iden":"constraints","content":"*   The length of $S$ is between $7$ and $100$ (inclusive).\n*   $S$ consists of lowercase English letters."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$"},{"iden":"sample input 1","content":"keyofscience"},{"iden":"sample output 1","content":"YES\n\n`keyence` is an abbreviation of `key of science`."},{"iden":"sample input 2","content":"mpyszsbznf"},{"iden":"sample output 2","content":"NO"},{"iden":"sample input 3","content":"ashlfyha"},{"iden":"sample output 3","content":"NO"},{"iden":"sample input 4","content":"keyence"},{"iden":"sample output 4","content":"YES"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}