import sys
import itertools
# import numpy as np
import time
import math
import heapq
from collections import defaultdict
from collections import Counter
sys.setrecursionlimit(10 ** 7)
 
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

# map(int, input().split())

S = input()
T = "keyence"

if T in S:
    print("YES")
    exit()
for i in range(1, 7):
    left = T[:i]
    right = T[i:]
    l_idx = S.find(left) 
    if l_idx == - 1:
        continue
    r_idx = S[l_idx + len(left):].find(right) 
    if r_idx == - 1:
        continue
    print("YES")
    exit()
print("NO")


