#include <bits/stdc++.h>
using namespace std;
int main() {
  string S;
  bool b = true;
  const string ch = "keyence";
  cin >> S;
  int l = 0, r = 0, p;
  p = S.find(ch);
  if (p != string::npos) {
    if (p != 0 || p != S.size() - ch.size()) b = false;
  } else {
    for (int i = 0; i < ch.size(); ++i) {
      if (S[i] == ch[i]) ++l;
    }
    for (int i = 0; i < ch.size(); ++i) {
      if (S[S.size() - 1 - i] == ch[ch.size() - 1 - i]) ++r;
    }
    if (l + r != ch.size()) b = false;
  }
  if (b)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}
