#include <bits/stdc++.h>
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 50;
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
using namespace std;
void solve() {
  string s;
  cin >> s;
  int n = s.size();
  char c[7] = {'k', 'e', 'y', 'e', 'n', 'c', 'e'};
  int cnt = 0;
  bool judge = true;
  for (int i = (int)0; i < (int)s.size(); ++i) {
    if (s[i] == c[cnt])
      ++cnt;
    else {
      if (judge) {
        while (s[i] != c[cnt]) {
          ++i;
          if (i == n) {
            cout << "NO\n";
            return;
          }
          if (s[i] == c[cnt]) {
            ++cnt;
            judge = false;
            break;
          }
        }
      } else {
        cout << "NO\n";
        return;
      }
    }
  }
  cout << "YES\n";
}
signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  solve();
  return 0;
}
