#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000000000001;
struct edge {
  int to, cost;
};
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
struct Road {
  double cost;
  int a, b;
};
int main() {
  string s;
  cin >> s;
  for (int i = 0; i < s.size(); ++i) {
    for (int j = i + 1; j < s.size() - 3; j++) {
      if (s.substr(j, 6) == "eyence" && s[i] == 'k') {
        cout << "YES" << endl;
        return 0;
      }
      if (s.substr(j + 1, 5) == "yence" && s[i] == 'k' && s[i + 1] == 'e') {
        cout << "YES" << endl;
        return 0;
      }
      if (s.substr(j + 2, 4) == "ence" && s[i] == 'k' && s[i + 1] == 'e' &&
          s[i + 2] == 'y') {
        cout << "YES" << endl;
        return 0;
      }
      if (s.substr(j + 3, 3) == "nce" && s[i] == 'k' && s[i + 1] == 'e' &&
          s[i + 2] == 'y' && s[i + 3] == 'e') {
        cout << "YES" << endl;
        return 0;
      }
      if (s.substr(j + 4, 2) == "ce" && s[i] == 'k' && s[i + 1] == 'e' &&
          s[i + 2] == 'y' && s[i + 3] == 'e' && s[i + 4] == 'n') {
        cout << "YES" << endl;
        return 0;
      }
      if (s[j + 5] == 'e' && s[i] == 'k' && s[i + 1] == 'e' &&
          s[i + 2] == 'y' && s[i + 3] == 'e' && s[i + 4] == 'n' &&
          s[i + 5] == 'c') {
        cout << "YES" << endl;
        return 0;
      }
    }
  }
  cout << "NO" << endl;
  return 0;
}
