#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, check = 0;
  vector<int> memo;
  bool judge = false;
  for (int i = (int)0; i < (int)n; ++i) {
    if (cnt == 7) {
      ++check;
      break;
    }
    if (s[0] != 'k') ++check;
    if (s[i] == c[cnt]) {
      memo.push_back(i);
      ++cnt;
    }
  }
  if (cnt < 7)
    cout << "NO\n";
  else {
    for (int i = (int)0; i < (int)memo.size() - 1; ++i) {
      if (memo[i + 1] - memo[i] > 1) ++check;
    }
    if (check > 1)
      cout << "NO\n";
    else
      cout << "YES\n";
  }
}
signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  solve();
  return 0;
}
