#include <bits/stdc++.h>
using namespace std;
int dp[200];
int Dp[200];
int main() {
  string s;
  int flag = 0;
  cin >> s;
  int len = s.length();
  for (int i = 0; i < len; i++) {
    if (s[i] == 'k' && flag == 0) flag = 1;
    if (s[i] == 'e' && flag == 1) flag = 2;
    if (s[i] == 'y' && flag == 2) flag = 3;
    if (s[i] == 'e' && flag == 3) flag = 4;
    if (s[i] == 'n' && flag == 4) flag = 5;
    if (s[i] == 'c' && flag == 5) flag = 6;
    if (s[i] == 'e' && flag == 6) flag = 7;
  }
  if (flag == 7) {
    int t = 0;
    flag = 0;
    for (int i = 0; i < len; i++) {
      if (s[i] == 'k') flag = 1;
      if (s[i] == 'e' && flag == 6) flag = 7;
      if (s[i] == 'e' && flag == 3) flag = 4;
      if (s[i] == 'e' && flag == 1) flag = 2;
      if (s[i] == 'e' && (flag != 2 && flag != 4 && flag != 7)) flag = 0;
      if (s[i] == 'y' && flag == 2) flag = 3;
      if (s[i] == 'y' && flag != 3) flag = 0;
      if (s[i] == 'n' && flag == 4) flag = 5;
      if (s[i] == 'n' && flag != 5) flag = 0;
      if (s[i] == 'c' && flag == 5) flag = 6;
      if (s[i] == 'c' && flag != 6) flag = 0;
      t = max(t, flag);
      dp[i] = t;
    }
    int tt = 7;
    flag = 0;
    for (int i = len - 1; i >= 0; i--) {
      if (s[i] == 'k' && flag == 1) flag = 0;
      if (s[i] == 'k' && flag != 0) flag = 7;
      if (s[i] == 'e' && flag == 7) flag = 6;
      if (s[i] == 'e' && flag == 4) flag = 3;
      if (s[i] == 'e' && flag == 2) flag = 1;
      if (s[i] == 'e' && (flag != 1 && flag != 3 && flag != 6)) flag = 6;
      if (s[i] == 'y' && flag == 3) flag = 2;
      if (s[i] == 'y' && flag != 2) flag = 7;
      if (s[i] == 'n' && flag == 5) flag = 4;
      if (s[i] == 'n' && flag != 4) flag = 7;
      if (s[i] == 'c' && flag == 6) flag = 5;
      if (s[i] == 'c' && flag != 5) flag = 7;
      tt = min(tt, flag);
      Dp[i] = tt;
    }
    flag = 0;
    for (int i = 0; i < len; i++) {
      if (dp[i] >= Dp[i]) flag = 1;
    }
    if (flag)
      printf("YES\n");
    else
      printf("NO\n");
  } else
    cout << "NO" << endl;
  return 0;
}
