# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub
import re
sys.setrecursionlimit(10000)


def read_int():
    return int(input())


def read_int_n():
    return list(map(int, input().split()))


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(S):
    K = 'keyence'
    if S == K:
        return 'YES'
    if re.match('[a-z]+'+K, S):
        return 'YES'
    if re.match(K+'[a-z]+', S):
        return 'YES'

    for i in range(len(K)):
        if re.match(K[:i]+'[a-z]+'+K[i:], S):
            return 'YES'

    return 'NO'


def main():
    S = read_str()
    print(slv(S))


if __name__ == '__main__':
    main()
