#include <bits/stdc++.h>
using namespace std;
template <typename Tn>
Tn gcd(Tn a, Tn b) {
  return (b ? gcd(b, a % b) : a);
}
template <typename Tn>
Tn lcm(Tn a, Tn b) {
  return a / gcd(a, b) * b;
}
long long int cnt = 0;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main() {
  string s;
  cin >> s;
  string k = "keyence";
  bool flg = false;
  int idx = s.find(k);
  if (idx != string::npos && (idx == 0 || idx == s.size() - k.size())) {
    flg = true;
  } else {
    for (int i = 1; i < k.size(); i++) {
      string a = "";
      string b = "";
      for (int j = 0; j < i; j++) a += k[j];
      for (int j = i; j < k.size(); j++) b += k[j];
      if (s.find(a) == 0 && s.find(b) == s.size() - b.size()) flg = true;
    }
  }
  if (flg)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}
