#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const string YES = "YES";
const string NO = "NO";
void solve(std::string S) {
  string keyence = "keyence";
  size_t keyence_index = 0;
  size_t begin = -1, end = -1;
  for (long long i = 0; i < S.length(); i++) {
    if (keyence_index >= keyence.length()) {
      cout << "YES" << endl;
      return;
    }
    if (keyence[keyence_index] != S[i]) {
      if (begin == -1) {
        begin = i;
      }
    } else {
      if (begin != -1) {
        end = i;
        break;
      }
      keyence_index++;
    }
  }
  if (begin == -1 && end == -1) {
    cout << "YES" << endl;
    return;
  } else if (begin != -1 && end == -1) {
    S.erase(begin, S.length() - begin);
  } else {
    S.erase(begin, end - begin);
  }
  if (S == "keyence") {
    cout << "YES" << endl;
  } else {
    cout << "NO" << endl;
  }
}
int main() {
  std::string S;
  std::cin >> S;
  solve(S);
  return 0;
}
