#include <bits/stdc++.h>
using namespace std;
long long H, W;
string S;
void solve() {
  string key = "keyence";
  if (equal(key.begin(), key.end(), S.begin())) {
    cout << "YES";
    return;
  }
  if (S.find(key) == S.size() - key.size()) {
    cout << "YES";
    return;
  }
  string keyF = "k";
  string keyE = "eyence";
  if (equal(keyF.begin(), keyF.end(), S.begin()) &&
      S.find(keyE) == S.size() - keyE.size()) {
    cout << "YES";
    return;
  }
  keyF = "ke";
  keyE = "yence";
  if (equal(keyF.begin(), keyF.end(), S.begin()) &&
      S.find(keyE) == S.size() - keyE.size()) {
    cout << "YES";
    return;
  }
  keyF = "key";
  keyE = "ence";
  if (equal(keyF.begin(), keyF.end(), S.begin()) &&
      S.find(keyE) == S.size() - keyE.size()) {
    cout << "YES";
    return;
  }
  keyF = "keye";
  keyE = "nce";
  if (equal(keyF.begin(), keyF.end(), S.begin()) &&
      S.find(keyE) == S.size() - keyE.size()) {
    cout << "YES";
    return;
  }
  keyF = "keyen";
  keyE = "ce";
  if (equal(keyF.begin(), keyF.end(), S.begin()) &&
      S.find(keyE) == S.size() - keyE.size()) {
    cout << "YES";
    return;
  }
  keyF = "keyenc";
  keyE = "e";
  if (equal(keyF.begin(), keyF.end(), S.begin()) &&
      S.find(keyE) == S.size() - keyE.size()) {
    cout << "YES";
    return;
  }
  cout << "NO";
  return;
}
int main() {
  cin >> S;
  solve();
  cout << endl;
  return 0;
}
