#include <bits/stdc++.h>
int gcd(int a, int b) {
  int c;
  while (b != 0) {
    c = a % b;
    a = b;
    b = c;
  }
  return a;
}
int lcm(int a, int b) {
  int c = gcd(a, b);
  a /= c;
  return a * b;
}
const int MOD = 1000000007;
const int INF = 1e9;
const long long LINF = INF * 1ll * INF;
const long double DINF = 1e200;
const double EPS = 1e-10;
const double PI = acos(-1.0);
using namespace std;
const long long dx[] = {0, 1, 0, -1};
const long long dy[] = {-1, 0, 1, 0};
signed main() {
  string s;
  cin >> s;
  for (long long i = 0; i < s.size(); i++) {
    if (s[i] == 'k') {
      for (long long j = i + 1; j < s.size(); j++) {
        if (s[j] == 'e') {
          for (long long k = j + 1; k < s.size(); k++) {
            if (s[k] == 'y') {
              for (long long l = k + 1; l < s.size(); l++) {
                if (s[l] == 'e') {
                  for (long long m = l + 1; j < s.size(); m++) {
                    if (s[m] == 'n') {
                      for (long long n = m + 1; j < s.size(); n++) {
                        if (s[n] == 'c') {
                          for (long long o = n + 1; o < s.size(); o++) {
                            if (s[o] == 'e') {
                              cout << "YES" << endl;
                            }
                          }
                        }
                      }
                    }
                  }
                }
              }
            }
          }
        }
      }
    }
  }
  cout << "NO" << endl;
}
