#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T>
T gcd(T x, T y) {
  if (x < y) {
    std::swap(x, y);
  }
  int r = x % y;
  while (r != 0) {
    x = y;
    y = r;
    r = x % y;
  }
  return y;
}
int main() {
  string s;
  cin >> s;
  string key = "keyence";
  int k = 0;
  for (int i = 0; i < s.size() - 7; ++i) {
    if (s.substr(i, 7).compare(key) == 0 &&
        (i == 0 || i + s.size() == s.size())) {
      cout << "YES" << endl;
      return 0;
    }
  }
  int left = 0;
  int right = key.size() - 1;
  for (int i = 0; i < (s.size() + 1) / 2; ++i) {
    int last = s.size() - i - 1;
    if (s[i] == key[left]) {
      ++left;
    }
    if (s[last] == key[right]) {
      --right;
    }
    if (left == right) {
      cout << "YES" << endl;
      return 0;
    }
  }
  cout << "NO" << endl;
  return 0;
}
