#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
void solve() {
  string s;
  cin >> s;
  int n = s.size();
  string k = "keyence";
  int m = k.size();
  int j = 0;
  vector<int> check(n);
  int id = -1;
  for (int i = 0; i < (int)(n); i++) {
    if (s[i] == k[j]) {
      j++;
      check[i] = 1;
      id = i;
    }
  }
  bool found = false;
  if (j == m) found = true;
  vector<int> check2;
  for (int i = 0; i < (int)(id + 1); i++) {
    if (check[i] == 1)
      continue;
    else {
      check2.push_back(i);
    }
  }
  bool ok = true;
  for (int i = 0; i < (int)(check2.size() - 1); i++) {
    if (check2[i + 1] - check2[i] != 1) ok = false;
  }
  if (ok && found)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
int main() {
  solve();
  return 0;
}
