#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
long long gcd(long long x, long long y) {
  long long tmp = 0;
  if (x < y) {
    tmp = x;
    x = y;
    y = tmp;
  }
  while (y > 0) {
    long long r = x % y;
    x = y;
    y = r;
  }
  return x;
}
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAX; i++) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}
long long COM(int n, int k) {
  if (n < k) return 0;
  if (n < 0 || k < 0) return 0;
  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long kaijo(long long k) {
  long long sum = 1;
  for (long long i = 1; i <= k; ++i) {
    sum *= i;
    sum %= 1000000000 + 7;
  }
  return sum;
}
long long lmax(long long s, long long t) {
  if (s > t) {
    return s;
  } else {
    return t;
  }
}
long long lmin(long long s, long long t) {
  if (s < t) {
    return s;
  } else {
    return t;
  }
}
long long modpow(long long res, long long a, long long n, long long mod) {
  while (n > 0) {
    if (n & 1) res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}
int main() {
  string s;
  cin >> s;
  int cnt = 0;
  bool mode = true;
  string tmp = "keyence";
  int mark = 0;
  for (int i = 0; i < s.length(); i++) {
    if (tmp[mark] == s[i]) {
      mode = true;
      mark++;
    } else {
      if (mode) {
        mode = false;
        cnt++;
      } else {
        ;
      }
    }
  }
  if (cnt < 2 && mark == 7)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}
