#include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wincompatible-pointer-types"
typedef struct {
  int32_t a;
  int32_t b;
} hw;
typedef struct {
  int64_t a;
  int64_t b;
} hwll;
typedef struct {
  int64_t a;
  int64_t b;
  int64_t c;
} hwllc;
typedef struct {
  hwll a;
  hwll b;
} linell;
uint64_t n, m;
uint64_t h, w;
uint64_t k;
uint64_t q;
int64_t va, vb, vc, vd, ve, vf;
uint64_t ua, ub, uc, ud, ue, uf;
long double vra, vrb, vrc;
double vda, vdb, vdc;
char ch, dh;
uint64_t umin(uint64_t x, uint64_t y) { return (x < y) ? x : y; }
uint64_t umax(uint64_t x, uint64_t y) { return (x > y) ? x : y; }
int64_t smin(int64_t x, int64_t y) { return (x < y) ? x : y; }
int64_t smax(int64_t x, int64_t y) { return (x > y) ? x : y; }
uint64_t gcd(uint64_t x, uint64_t y) {
  if (x < y) {
    return gcd(y, x);
  } else if (y == 0) {
    return x;
  } else {
    return gcd(y, x % y);
  }
}
uint64_t bitpow(uint64_t a, uint64_t x, uint64_t modulo) {
  uint64_t result = 1;
  while (x) {
    if (x & 1) {
      result *= a;
      result %= modulo;
    }
    x /= 2;
    a = (a * a) % modulo;
  }
  return result;
}
uint64_t divide(uint64_t a, uint64_t b, uint64_t modulo) {
  return (a * bitpow(b, modulo - 2, modulo)) % modulo;
}
uint64_t udiff(uint64_t a, uint64_t b) {
  if (a >= b) {
    return a - b;
  } else {
    return b - a;
  }
}
int64_t sdiff(int64_t a, int64_t b) {
  if (a >= b) {
    return a - b;
  } else {
    return b - a;
  }
}
int bitcount(uint64_t n) {
  int result = 0;
  while (n) {
    if (n & 1) result++;
    n /= 2;
  }
  return result;
}
int32_t pullcomp(const void *left, const void *right) {
  uint64_t l = *(uint64_t *)left, r = *(uint64_t *)right;
  if ((l) < (r)) return -1;
  if ((l) > (r)) return +1;
  return 0;
}
int32_t prevcomp(const void *left, const void *right) {
  uint64_t l = *(uint64_t *)left, r = *(uint64_t *)right;
  if ((r) < (l)) return -1;
  if ((r) > (l)) return +1;
  return 0;
}
int32_t psllcomp(const void *left, const void *right) {
  int64_t l = *(int64_t *)left, r = *(int64_t *)right;
  if ((l) < (r)) return -1;
  if ((l) > (r)) return +1;
  return 0;
}
int32_t pcharcomp(const void *left, const void *right) {
  char l = *(char *)left, r = *(char *)right;
  if ((l) < (r)) return -1;
  if ((l) > (r)) return +1;
  return 0;
}
int32_t pdoublecomp(const void *left, const void *right) {
  double l = *(double *)left, r = *(double *)right;
  if ((l) < (r)) return -1;
  if ((l) > (r)) return +1;
  return 0;
}
int32_t pstrcomp(const void *left, const void *right) {
  char *l = *(char **)left;
  char *r = *(char **)right;
  return strcmp(l, r);
}
int32_t phwllABcomp(const void *left, const void *right) {
  hwll l = *(hwll *)left, r = *(hwll *)right;
  if ((l.a) < (r.a)) return -1;
  if ((l.a) > (r.a)) return +1;
  if ((l.b) < (r.b)) return -1;
  if ((l.b) > (r.b)) return +1;
  return 0;
}
int32_t phwllREVcomp(const void *left, const void *right) {
  hwll l = *(hwll *)left, r = *(hwll *)right;
  if ((l.b) < (r.b)) return -1;
  if ((l.b) > (r.b)) return +1;
  if ((l.a) < (r.a)) return -1;
  if ((l.a) > (r.a)) return +1;
  return 0;
}
int32_t ptriplecomp(const void *left, const void *right) {
  hwllc l = *(hwllc *)left, r = *(hwllc *)right;
  if ((l.a) < (r.a)) return -1;
  if ((l.a) > (r.a)) return +1;
  if ((l.b) < (r.b)) return -1;
  if ((l.b) > (r.b)) return +1;
  if ((l.c) < (r.c)) return -1;
  if ((l.c) > (r.c)) return +1;
  return 0;
}
int32_t ptripleREVcomp(const void *left, const void *right) {
  hwllc l = *(hwllc *)left, r = *(hwllc *)right;
  if ((l.b) < (r.b)) return -1;
  if ((l.b) > (r.b)) return +1;
  if ((l.a) < (r.a)) return -1;
  if ((l.a) > (r.a)) return +1;
  if ((l.c) < (r.c)) return -1;
  if ((l.c) > (r.c)) return +1;
  return 0;
}
int32_t pquadcomp(const void *left, const void *right) {
  linell l = *(linell *)left;
  linell r = *(linell *)right;
  int64_t ac = phwllABcomp(&(l.a), &(r.a));
  if (ac) return ac;
  int64_t bc = phwllABcomp(&(l.b), &(r.b));
  if (bc) return bc;
  return 0;
}
bool isinrange(int64_t left, int64_t x, int64_t right) {
  return (left <= x && x <= right);
}
bool isinrange_soft(int64_t left, int64_t x, int64_t right) {
  return (left <= x && x <= right) || (left >= x && x >= right);
}
int64_t a[1000000 + 5];
int64_t b[1000000 + 5];
int64_t c[1000000 + 5];
uint64_t d[1000000 + 5];
int64_t e[1000000];
char s[1000000 + 1];
char t[1000000 + 1];
char u[1000000 + 1];
hwll xy[1000000 + 5];
hwllc tup[1000000 + 5];
int64_t table[3005][3005];
uint64_t dp[1000000];
uint64_t solve() {
  int64_t i, j, ki, li;
  int64_t result = 0;
  double dresult = 0;
  int64_t maybe = 0;
  int64_t sum = 0;
  int64_t item;
  uint64_t *dpcell;
  char t[] = "keyence";
  n = strlen(s);
  for (i = 0; i < n; i++) {
    for (j = 1; j <= 7; j++) {
      if (s[i + (j - 1)] != t[j - 1]) break;
      for (ki = i + j; ki < n; ki++) {
        for (li = j + 1; li <= 7; li++) {
          if (s[ki + (li - j - 1)] != t[li - 1]) break;
        }
        if (li > 7) goto success;
      }
    }
  }
  goto fail;
  printf("%lld\n", result);
  return 0;
success:
  puts("YES");
  return 0;
fail:
  puts("NO");
  return 1;
}
int32_t main(void) {
  int32_t i, j;
  int32_t x, y;
  n = 4;
  scanf("%s", s);
  solve();
  return 0;
}
