from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations # (string,3) 3回
from collections import deque
from collections import defaultdict
import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
ans = 'keyence'
S = input()
lenS = len(S)
for i in range(7):
    #print(ans[i:],S[lenS-7 + i:])
    #print(ans[:i], S[:i])
    if ans[:i] == S[:i] and ans[i:] == S[lenS - i - 1:]:
        print('YES')
        exit()
print('NO')
