# -*- coding: utf-8 -*-



import sys, re

from collections import deque, defaultdict, Counter

from math import sqrt, hypot, factorial, pi, sin, cos, radians

if sys.version_info.minor >= 5: from math import gcd

else: from fractions import gcd 

from heapq import heappop, heappush, heapify, heappushpop

from bisect import bisect_left, bisect_right

from itertools import permutations, combinations, product

from operator import itemgetter, mul

from copy import deepcopy

from functools import reduce, partial

from fractions import Fraction

from string import ascii_lowercase, ascii_uppercase, digits



def input(): return sys.stdin.readline().strip()

def list2d(a, b, c): return [[c] * b for i in range(a)]

def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]

def ceil(x, y=1): return int(-(-x // y))

def round(x): return int((x*2+1) // 2)

def fermat(x, y, MOD): return x * pow(y, MOD-2, MOD) % MOD

def lcm(x, y): return (x * y) // gcd(x, y)

def lcm_list(nums): return reduce(lcm, nums, 1)

def gcd_list(nums): return reduce(gcd, nums, nums[0])

def INT(): return int(eval(input()))

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

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

sys.setrecursionlimit(10 ** 9)

INF = float('inf')

MOD = 10 ** 9 + 7



S = eval(input())

target = 'keyence'



for i in range(len(target)+1):

    a = target[:i]

    b = target[i:]

    if re.match('^' + a + '.*' + b + '$', S):

        print('YES')

        exit()

print('NO')

import sys

import re



def input(): return sys.stdin.readline().strip()

def list2d(a, b, c): return [[c] * b for i in range(a)]

def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]

def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]

def ceil(x, y=1): return int(-(-x // y))

def INT(): return int(eval(input()))

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

def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]

def Yes(): print('Yes')

def No(): print('No')

def YES(): print('YES')

def NO(): print('NO')

sys.setrecursionlimit(10 ** 9)

INF = 10 ** 19

MOD = 10 ** 9 + 7



S = 'keyence'

N = len(S)

T = eval(input())

M = len(T)



for i in range(N+1):

    S1 = S[:i]

    S2 = S[i:]

    exp = '^{0}(.*){1}$'.format(S1, S2)

    if re.match(exp, T):

        YES()

        exit()

NO()

# -*- coding: utf-8 -*-
import sys, re
from collections import deque, defaultdict, Counter
from math import sqrt, hypot, factorial, pi, sin, cos, radians

if sys.version_info.minor >= 5:
    from math import gcd
else:
    from fractions import gcd
from heapq import heappop, heappush, heapify, heappushpop
from bisect import bisect_left, bisect_right
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from functools import reduce, partial
from fractions import Fraction
from string import ascii_lowercase, ascii_uppercase, digits


def input():
    return sys.stdin.readline().strip()


def list2d(a, b, c):
    return [[c] * b for i in range(a)]


def list3d(a, b, c, d):
    return [[[d] * c for j in range(b)] for i in range(a)]


def ceil(x, y=1):
    return int(-(-x // y))


def round(x):
    return int((x * 2 + 1) // 2)


def fermat(x, y, MOD):
    return x * pow(y, MOD - 2, MOD) % MOD


def lcm(x, y):
    return (x * y) // gcd(x, y)


def lcm_list(nums):
    return reduce(lcm, nums, 1)


def gcd_list(nums):
    return reduce(gcd, nums, nums[0])


def INT():
    return int(eval(input()))


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


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


sys.setrecursionlimit(10**9)
INF = float("inf")
MOD = 10**9 + 7
S = eval(input())
target = "keyence"
for i in range(len(target) + 1):
    a = target[:i]
    b = target[i:]
    if re.match("^" + a + ".*" + b + "$", S):
        print("YES")
        exit()
print("NO")

import sys
import re


def input():
    return sys.stdin.readline().strip()


def list2d(a, b, c):
    return [[c] * b for i in range(a)]


def list3d(a, b, c, d):
    return [[[d] * c for j in range(b)] for i in range(a)]


def list4d(a, b, c, d, e):
    return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]


def ceil(x, y=1):
    return int(-(-x // y))


def INT():
    return int(eval(input()))


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


def LIST(N=None):
    return list(MAP()) if N is None else [INT() for i in range(N)]


def Yes():
    print("Yes")


def No():
    print("No")


def YES():
    print("YES")


def NO():
    print("NO")


sys.setrecursionlimit(10**9)
INF = 10**19
MOD = 10**9 + 7
S = "keyence"
N = len(S)
T = eval(input())
M = len(T)
for i in range(N + 1):
    S1 = S[:i]
    S2 = S[i:]
    exp = "^{0}(.*){1}$".format(S1, S2)
    if re.match(exp, T):
        YES()
        exit()
NO()

-# -*- coding: utf-8 -*- -import sys, re -from collections import deque, defaultdict, Counter -from math import sqrt, hypot, factorial, pi, sin, cos, radians - -if sys.version_info.minor >= 5: -    from math import gcd -else: -    from fractions import gcd -from heapq import heappop, heappush, heapify, heappushpop -from bisect import bisect_left, bisect_right -from itertools import permutations, combinations, product -from operator import itemgetter, mul -from copy import deepcopy -from functools import reduce, partial -from fractions import Fraction -from string import ascii_lowercase, ascii_uppercase, digits +import sys +import re +def list4d(a, b, c, d, e): +    return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)] + + - - -def round(x): -    return int((x * 2 + 1) // 2) - - -def fermat(x, y, MOD): -    return x * pow(y, MOD - 2, MOD) % MOD - - -def lcm(x, y): -    return (x * y) // gcd(x, y) - - -def lcm_list(nums): -    return reduce(lcm, nums, 1) - - -def gcd_list(nums): -    return reduce(gcd, nums, nums[0]) -def LIST(): -    return list(map(int, input().split())) +def LIST(N=None): +    return list(MAP()) if N is None else [INT() for i in range(N)] + + +def Yes(): +    print("Yes") + + +def No(): +    print("No") + + +def YES(): +    print("YES") + + +def NO(): +    print("NO") -INF = float("inf") +INF = 10**19 -S = eval(input()) -target = "keyence" -for i in range(len(target) + 1): -    a = target[:i] -    b = target[i:] -    if re.match("^" + a + ".*" + b + "$", S): -        print("YES") +S = "keyence" +N = len(S) +T = eval(input()) +M = len(T) +for i in range(N + 1): +    S1 = S[:i] +    S2 = S[i:] +    exp = "^{0}(.*){1}$".format(S1, S2) +    if re.match(exp, T): +        YES() -print("NO") +NO()