#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
long long qpow(long long x, long long y) {
  long long s = 1;
  while (y) {
    if (y & 1) s = s * x % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return s;
}
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return x * f;
}
long long inve(long long x) {
  return x == 1 ? 1 : (mod - mod / x) * inve(mod % x) % mod;
}
const int N = 1e6 + 5;
char s[N], ch[] = {"keyence"};
int main() {
  cin >> s;
  int l = strlen(s), j = 0;
  for (int i = 0; i < l; i++) {
    if (s[i] == ch[j]) j++;
    if (j > 6)
      return cout << "YES"
                  << "\n",
             0;
  }
  cout << "NO"
       << "\n";
  return 0;
}
