#include <bits/stdc++.h>
using String = std::string;
using llong = long long;
using boolean = bool;
using Pii = std::pair<int, int>;
using Vi = std::vector<int>;
using Vii = std::vector<Pii>;
constexpr int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
constexpr int INF = 0x3f3f3f3f;
constexpr llong LINF = 0x3f3f3f3f3f3f3f3fLL;
namespace {
llong power(llong x, llong n, llong mod) {
  llong ans = 1;
  while (n > 0) {
    if (n & 1) ans = (ans * x) % mod;
    x = (x * x) % mod;
    n >>= 1;
  }
  return ans;
}
llong power(llong x, llong n) { return power(x, n, 1000000007); }
llong gcd(llong x, llong y) { return x % y ? gcd(y, x % y) : y; }
llong lcm(llong x, llong y) { return (x / gcd(x, y) * y); }
llong abs(llong n) { return (n < 0) ? -n : n; }
boolean isMovable(int x, int y, int w, int h) {
  return (x >= 0 && y >= 0 && x < w && y < h);
}
}  // namespace
namespace Rlyeh {
String t = "keyence";
String q[] = {"k", "ke", "key", "keye", "keyen", "keyenc"};
String w[] = {"eyence", "yence", "ence", "nce", "ce", "e"};
signed call_of_Cthulhu(signed datum) {
  String a;
  std::cin >> a;
  int n = a.size();
  String r = a;
  reverse(r.begin(), r.end());
  if (a.find(t) == 0) {
    std::cout << "YES" << '\n';
    return 0;
  }
  reverse(t.begin(), t.end());
  if (r.find(t) == 0) {
    std::cout << "YES" << '\n';
    return 0;
  }
  for (int i = 0; i < 6; i++) {
    reverse(w[i].begin(), w[i].end());
    if (a.find(q[i]) == 0 && r.find(w[i])) {
      std::cout << "YES" << '\n';
      return 0;
    }
  }
  std::cout << "NO" << '\n';
  return 0;
}
}  // namespace Rlyeh
signed main() {
  std::cin.tie(0);
  std::ios::sync_with_stdio(false);
  int main_result = Rlyeh::call_of_Cthulhu(114514);
  return 0;
}
