#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using ll = long long;
const int INF = 2147483647;
const int MINF = -2147483648;
const ll LINF = ll(9223372036854775807);
const ll MOD = 1000000007;
const double PI = acos(-1);
using namespace std;
int ggd(int number1, int number2) {
  int m = number1;
  int n = number2;
  if (number2 > number1) {
    m = number2;
    n = number1;
  }
  while (m != n) {
    int temp = n;
    n = m - n;
    m = temp;
  }
  return m;
}
int lcm(int number1, int number2) {
  return number1 * number2 / ggd(number1, number2);
}
bool is_prime(int64_t x) {
  for (int64_t i = 2; i * i <= x; i++) {
    if (x % i == 0) return false;
  }
  return true;
}
ll nearPow2(ll n) {
  if (n <= 0) return 0;
  if ((n & (n - 1)) == 0) return ll(n);
  ll ret = 1;
  while (n > 0) {
    ret <<= 1;
    n >>= 1;
  }
  return ret;
}
map<int64_t, int> prime_factor(int64_t n) {
  map<int64_t, int> ret;
  for (int64_t i = 2; i * i <= n; i++) {
    while (n % i == 0) {
      ret[i]++;
      n /= i;
    }
  }
  if (n != 1) ret[n] = 1;
  return ret;
}
template <int mod>
struct ModInt {
  int x;
  ModInt() : x(0) {}
  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
  ModInt& operator+=(const ModInt& p) {
    if ((x += p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt& operator-=(const ModInt& p) {
    if ((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt& operator*=(const ModInt& p) {
    x = (int)(1LL * x * p.x % mod);
    return *this;
  }
  ModInt& operator/=(const ModInt& p) {
    *this *= p.inverse();
    return *this;
  }
  ModInt operator-() const { return ModInt(-x); }
  ModInt operator+(const ModInt& p) const { return ModInt(*this) += p; }
  ModInt operator-(const ModInt& p) const { return ModInt(*this) -= p; }
  ModInt operator*(const ModInt& p) const { return ModInt(*this) *= p; }
  ModInt operator/(const ModInt& p) const { return ModInt(*this) /= p; }
  bool operator==(const ModInt& p) const { return x == p.x; }
  bool operator!=(const ModInt& p) const { return x != p.x; }
  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while (b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }
  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while (n > 0) {
      if (n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }
  friend ostream& operator<<(ostream& os, const ModInt& p) { return os << p.x; }
  friend istream& operator>>(istream& is, ModInt& a) {
    int64_t t;
    is >> t;
    a = ModInt<mod>(t);
    return (is);
  }
  static int get_mod() { return mod; }
};
using modint = ModInt<MOD>;
long long modinv(long long a, long long m) {
  long long b = m, u = 1, v = 0;
  while (b) {
    long long t = a / b;
    a -= t * b;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  u %= m;
  if (u < 0) u += m;
  return u;
}
ll aCb(ll a, ll b) {
  ll ans = 1;
  for (ll i = 0; i < b; i++) {
    ans *= a - i;
    ans %= MOD;
  }
  for (ll i = 1; i <= b; i++) {
    ans *= modinv(i, MOD);
    ans %= MOD;
  }
  return ans;
}
void scans(string& str) {
  char s[114514];
  scanf("%s", s);
  str = s;
}
int main() {
  string key = "keyence";
  string s;
  scans(s);
  bool b = false;
  if (s.find("keyence") != string::npos) {
    b = true;
    printf(b ? "YES\n" : "NO\n");
    return 0;
  }
  for (int i = 0; i < (6); ++i) {
    int finding = s.substr(0, 7).find(key.substr(0, i + 1));
    if (finding != string::npos &&
        s.substr(s.length() - 8, s.length() - 1).find(key.substr(i + 1)) !=
            string::npos) {
      b = true;
      break;
    }
  }
  printf(b ? "YES\n" : "NO\n");
  return 0;
}
