#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  string S;
  cin >> S;
  string K = "keyence";
  long long k = 0;
  bool ok1 = true;
  long long cnt = 0;
  for (long long i = 0; i < long long(S.size()); i++) {
    if (ok1 && cnt < 2) {
      if (S[i] == K[k]) {
        k++;
        if (k == 7) {
          cout << "YES";
          return 0;
        }
      } else if (S[i] != K[k])
        ok1 = false;
    }
    if (!ok1) {
      if (S[i] == K[k]) {
        k++;
        ok1 = true;
        cnt++;
        if (k == 7) {
          cout << "YES";
          return 0;
        }
      } else
        continue;
    }
  }
  cout << "NO" << endl;
  return 0;
}
