import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv,
    std.functional, std.math, std.numeric, std.range, std.stdio, std.string,
    std.random, std.typecons, std.container;

ulong MAX = 100_100, MOD = 1_000_000_007, INF = 1_000_000_000_000;
alias sread = () => readln.chomp();
alias lread(T = long) = () => readln.chomp.to!(T);
alias aryread(T = long) = () => readln.split.to!(T[]);
alias Pair = Tuple!(long, "x", long, "y");
alias PQueue(T, alias less = "a>b") = BinaryHeap!(Array!T, less);

void main()
{
    auto s = sread();
    if (s.solve())
        writeln("YES");
    else
        writeln("NO");
}

bool solve(string s)
{
    auto key = "keyence";
    if (s[0 .. key.length] == key)
        return true;
    if (s[$ - key.length .. $] == key)
        return true;

    long iter;
    while (s[iter] == key[iter])
        iter++;

    // s[$ - (key.length - iter) .. $].writeln();
    // key[iter .. $].writeln();
    return (s[$ - (key.length - iter) .. $] == key[iter .. $]);
}

void scan(TList...)(ref TList Args)
{
    auto line = readln.split();
    foreach (i, T; TList)
    {
        T val = line[i].to!(T);
        Args[i] = val;
    }
}
