#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;
  int total = 0;
  int f = 0;
  cin >> s;
  for (int i = 0; i < s.size(); ++i) {
    if (total == 0 && s[i] == 'k') {
      total++;
      if (s[i + 1] != 'e') {
        f = 1;
      }
    }
    if (total == 1 && s[i] == 'e') {
      total++;
      if (s[i + 1] != 'y') {
        f = 1;
      }
      if (f > 1) {
        f = 0;
        total = 0;
      }
    }
    if (total == 2 && s[i] == 'y') {
      total++;
      if (s[i + 1] != 'e') {
        f = 1;
      }
      if (f > 1) {
        f = 0;
        total = 0;
      }
    }
    if (total == 3 && s[i] == 'e') {
      total++;
      if (s[i + 1] != 'n') {
        f = 1;
      }
      if (f > 1) {
        f = 0;
        total = 0;
      }
    }
    if (total == 4 && s[i] == 'n') {
      total++;
      if (s[i + 1] != 'c') {
        f = 1;
      }
      if (f > 1) {
        f = 0;
        total = 0;
      }
    }
    if (total == 5 && s[i] == 'c') {
      total++;
      if (s[i + 1] != 'e') {
        f = 1;
      } else {
        if (f <= 1) {
          cout << "YES" << endl;
          return 0;
        } else {
          f = 0;
          total = 0;
        }
      }
    }
  }
  cout << "NO" << endl;
  return 0;
}
