def dfs(i, j, s):
    if j == 7:
        return s == 'keyence'
    if i >= N:
        return False
    res = False
    for k in range(i+1, N):
        res |= dfs(k, j+1, s+S[k])
    return res

S = input()
N = len(S)
flg = 0
for i in range(N-7+1):
    if S[i] == 'k':
        flg |= dfs(i, 1, 'k')
if flg:
    print('YES')
else:
    print('NO')