#include <bits/stdc++.h>
using namespace std;
template <class T>
using reversed_priority_queue = priority_queue<T, vector<T>, greater<T> >;
int main() {
  string S;
  cin >> S;
  string keyence = "keyence";
  if (S == keyence) {
    cout << "YES" << endl;
    return 0;
  }
  for (int i = 1; i <= S.size(); i++) {
    for (int j = 0; j <= S.size() - i; j++) {
      string T;
      for (int k = 0; k < S.size(); k++) {
        if (k < j || j + i < k) {
          T.push_back(S[k]);
        }
      }
      if (T == keyence) {
        cout << "YES" << endl;
        return 0;
      }
    }
  }
  cout << "NO" << endl;
  return 0;
}
