#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];
char t[] = "keyence   ";
int main() {
  scanf("%s", s);
  long long n = strlen(s);
  int ctr1 = 0, ctr2 = 0;
  for (long long i = (0); i < (n); i++)
    if (s[i] == t[i]) ctr1++;
  for (int i = n - 1; i >= 0; i--)
    if (s[i] == t[6 - (n - 1 - i)]) ctr2++;
  puts(ctr1 + ctr2 >= 7 ? "YES" : "NO");
  return 0;
}
