#include <bits/stdc++.h>
using namespace std;
int main() {
  string s;
  string key = "keyence";
  int cnt = 0;
  cin >> s;
  int k = (int)s.find("k");
  if (k == -1) {
    cout << "NO" << endl;
    return (0);
  } else if (k != 0) {
    cnt++;
  }
  int e1 = (int)s.find("e");
  if (e1 == -1) {
    cout << "NO" << endl;
    return (0);
  }
  while (e1 < k) {
    e1 = (int)s.find("e", e1 + 1);
  }
  if (e1 - k != 1) {
    cnt++;
  }
  int y = (int)s.find("y");
  if (y == -1) {
    cout << "NO" << endl;
    return (0);
  }
  while (y < e1) {
    y = (int)s.find("y", y + 1);
  }
  if (y - e1 != 1) {
    cnt++;
  }
  int e2 = (int)s.find("e");
  while (e2 < y) {
    e2 = (int)s.find("e", e2 + 1);
  }
  if (e2 - y != 1) {
    cnt++;
  }
  int n = (int)s.find("n");
  if (n == -1) {
    cout << "NO" << endl;
    return (0);
  }
  while (n < e2) {
    n = (int)s.find("n", n + 1);
  }
  if (n - e2 != 1) {
    cnt++;
  }
  int c = (int)s.find("c");
  if (c == -1) {
    cout << "NO" << endl;
    return (0);
  }
  while (c < n) {
    c = (int)s.find("c", c + 1);
  }
  if (c - n != 1) {
    cnt++;
  }
  int e3 = (int)s.find("e");
  while (e3 < c) {
    e3 = (int)s.find("e", e3 + 1);
  }
  if (e3 - c != 1) {
    cnt++;
  }
  if (e3 != (int)s.size() - 1) {
    cnt++;
  }
  if (cnt > 1) {
    cout << "NO" << endl;
  } else {
    cout << "YES" << endl;
  }
}
