#include <bits/stdc++.h>
int upll(const void* a, const void* b) {
  return *(long long*)a < *(long long*)b   ? -1
         : *(long long*)a > *(long long*)b ? 1
                                           : 0;
}
int downll(const void* a, const void* b) {
  return *(long long*)a < *(long long*)b   ? 1
         : *(long long*)a > *(long long*)b ? -1
                                           : 0;
}
void sortup(long long* a, int n) { qsort(a, n, sizeof(long long), upll); }
void sortdown(long long* a, int n) { qsort(a, n, sizeof(long long), downll); }
long long pom(long long a, long long n, int m) {
  long long x = 1;
  for (a %= m; n; n /= 2) n& 1 ? x = x * a % m : 0, a = a * a % m;
  return x;
}
char s[110];
int main() {
  scanf("%s", s);
  char* p0 = strstr(s, "keyence");
  char* p1 = strstr(s, "keyenc") ? strstr(strstr(s, "keyenc") + 6, "e") : NULL;
  char* p2 = strstr(s, "keyen") ? strstr(strstr(s, "keyen") + 5, "ce") : NULL;
  char* p3 = strstr(s, "keye") ? strstr(strstr(s, "keye") + 4, "nce") : NULL;
  char* p4 = strstr(s, "key") ? strstr(strstr(s, "key") + 3, "ence") : NULL;
  char* p5 = strstr(s, "ke") ? strstr(strstr(s, "ke") + 2, "yence") : NULL;
  char* p6 = strstr(s, "k") ? strstr(strstr(s, "k") + 1, "eyence") : NULL;
  puts(p0 || p1 || p2 || p3 || p4 || p5 || p6 ? "YES" : "NO");
  return 0;
}
