#include <bits/stdc++.h>
using namespace std;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const long long mod = 1000000007;
const long long inf = long long(1e9);
const long long half_inf = long long(1e5);
const long long ll_inf = long long(1e9) * long long(1e9);
int main() {
  string s;
  cin >> s;
  string k = "keyence";
  if (s.length() < k.length()) {
    cout << "NO" << endl;
    return 0;
  }
  if (s.substr(0, k.length()) == k) {
    cout << "YES" << endl;
    return 0;
  }
  if (s.substr(s.length() - k.length(), k.length()) == k) {
    cout << "YES" << endl;
    return 0;
  }
  int idxs = 0, idxk = 0;
  string ans;
  while (idxs < s.length() && idxk < k.length()) {
    bool b = false;
    while (idxs < s.length() && idxk < k.length() && s[idxs] == k[idxk]) {
      ans += s[idxs];
      idxs++, idxk++;
      if (ans == k) {
        b = true;
        break;
      }
    }
    if (b) break;
    while (idxs < s.length() && s[idxs] != k[idxk]) {
      idxs++;
    }
  }
  if (idxs < s.length() - 1) ans += s[idxs + 1];
  if (k == ans)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}
