#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
  string S;
  cin >> S;
  int pos = S.find("keyence");
  if (pos != -1) {
    cout << "YES" << endl;
    return 0;
  }
  pos = S.find("eyence");
  if (pos != -1) {
    for (int i = 0; i <= pos; i++) {
      if (S[i] == 'k') {
        cout << "YES" << endl;
        return 0;
      }
    }
  }
  pos = S.find("yence");
  if (pos != -1) {
    for (int i = 0; i < pos; i++) {
      if (S[i] == 'k' and S[i + 1] == 'e') {
        cout << "YES" << endl;
        return 0;
      }
    }
  }
  pos = S.find("ence");
  if (pos != -1) {
    for (int i = 0; i < pos - 1; i++) {
      if (S[i] == 'k' and S[i + 1] == 'e' and S[i + 2] == 'y') {
        cout << "YES" << endl;
        return 0;
      }
    }
  }
  pos = S.find("nce");
  if (pos != -1) {
    for (int i = 0; i < pos - 2; i++) {
      if (S[i] == 'k' and S[i + 1] == 'e' and S[i + 2] == 'y' and
          S[i + 3] == 'e') {
        cout << "YES" << endl;
        return 0;
      }
    }
  }
  pos = S.find("ce");
  if (pos != -1) {
    for (int i = 0; i < pos - 3; i++) {
      if (S[i] == 'k' and S[i + 1] == 'e' and S[i + 2] == 'y' and
          S[i + 3] == 'e' and S[i + 4] == 'n') {
        cout << "YES" << endl;
        return 0;
      }
    }
  }
  pos = S.find("e");
  if (pos != -1) {
    for (int i = 0; i < pos - 4; i++) {
      if (S[i] == 'k' and S[i + 1] == 'e' and S[i + 2] == 'y' and
          S[i + 3] == 'e' and S[i + 4] == 'n' and S[i + 5] == 'c') {
        cout << "YES" << endl;
        return 0;
      }
    }
  }
  cout << "NO" << endl;
}
