#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
void coY() { cout << "Yes" << endl; }
void coN() { cout << "No" << endl; }
const ll INF = 1LL << 60;
const int mod = 1e9 + 7;
int main() {
  string s;
  cin >> s;
  string s1, s2;
  string search = "keyence";
  int co = 7;
  int depo = -1;
  string next_search = "";
  string fn = "ecneyek";
  int count = 0;
  while (1) {
    for (int i = (0); i < (s.size() - co); ++i) {
      s1 = s.substr(i, co);
      if (s1 == search) {
        depo = i + co;
        goto SKIP;
      }
    }
    co--;
    search.pop_back();
    next_search.push_back(fn[count]);
    count++;
  }
SKIP:
  cerr << "depo"
       << " = " << (depo) << endl;
  ;
  cerr << "search"
       << " = " << (search) << endl;
  ;
  reverse((next_search).begin(), (next_search).end());
  cerr << "next_search"
       << " = " << (next_search) << endl;
  ;
  while (1) {
    for (int i = depo; i <= s.size() - next_search.size(); i++) {
      s2 = s.substr(i, next_search.size());
      cerr << "s2"
           << " = " << (s2) << endl;
      ;
      if (s2 == next_search) {
        cout << "YES" << endl;
        return 0;
      }
    }
    break;
  }
  cout << "NO" << endl;
}
