###template###
import sys
def input(): return sys.stdin.readline().rstrip()
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt, ceil, floor
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
import heapq
INF = float("inf")
MOD = 10**9 + 7
sys.setrecursionlimit(10**7)
# 4近傍（右, 下, 左, 上）
dy = [0, -1, 0, 1]
dx = [1, 0, -1, 0]
def inside(y: int, x: int, H: int, W: int) -> bool: return 0 <= y < H and 0 <= x < W
def mi(): return map(int, input().split())
def ii(): return int(input())
###template###

S = input()
N = len(S)

if 'keyence' in S:
  print('YES')
  exit()

if N==7:
  print('NO')
  exit()

for l in range(N - 8):
  if S[l:l+6]=='keyenc' and 'e' in S[l+7:N]:
    print('YES')
    exit()

for l in range(N - 7):
  if S[l:l+5]=='keyen' and 'ce' in S[l+6:N]:
    print('YES')
    exit()

for l in range(N - 6):
  if S[l:l+4]=='keye' and 'nce' in S[l+5:N]:
    print('YES')
    exit()

for l in range(N - 5):
  if S[l:l+3]=='key' and 'ence' in S[l+4:N]:
    print('YES')
    exit()

for l in range(N - 4):
  if S[l:l+2]=='ke' and 'yence' in S[l+3:N]:
    print('YES')
    exit()

for l in range(N - 8):
  if S[l:l+1]=='k' and 'eyence' in S[l+2:N]:
    print('YES')
    exit()

print('NO')
