#include <bits/stdc++.h>
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6;
const long long LINF = 1e18;
using namespace std;
long long cnt, ans, a, b, c, d, e[ohara], tmp, tmpp, h, w, x, y[ohara], sum,
    pos;
long double doua;
int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
string alph("abcdefghijklmnopqrstuvwxyz"), s;
bool fl;
struct edge {
  int to, cost;
};
map<char, long long> mp;
int main(void) {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> s;
  for (int(i) = 0; (i) < (int)((s).size()); (i)++) {
    if (s[i] == 'k') {
      for (int j = (i + 1); j < ((s).size()); j++) {
        if (s[j] == 'e') {
          for (int k = (j + 1); k < ((s).size()); k++) {
            if (s[k] == 'y') {
              for (int l = (k + 1); l < ((s).size()); l++) {
                if (s[l] == 'e') {
                  for (int m = (l + 1); m < ((s).size()); m++) {
                    if (s[m] == 'n') {
                      for (int n = (m + 1); n < ((s).size()); n++) {
                        if (s[n] == 'c') {
                          for (int o = (n + 1); o < ((s).size()); o++) {
                            if (s[o] == 'e') {
                              cout << ("YES") << endl;
                              return 0;
                            }
                          }
                        }
                      }
                    }
                  }
                }
              }
            }
          }
        }
      }
    }
  }
  cout << ("NO") << endl;
  return 0;
}
