#include <bits/stdc++.h>
using namespace std;
int ans;
int max(int x, int y) { return x > y ? x : y; }
int min(int x, int y) { return x < y ? x : y; }
int abs(int x) { return x > 0 ? x : -x; }
int gcd(int x, int y) { return (!y) ? x : gcd(y, x % y); }
void exgcd(int a, int b, int &d, int &x, int &y) {
  if (!b) {
    d = a, x = 1, y = 0;
  } else {
    exgcd(b, a % b, d, y, x);
    y -= x * (a / b);
  }
}
int quick_power(long long a, int b) {
  long long r = 1;
  for (; b; b >>= 1, a = a * a)
    if (b & 1) r = r * a;
  return r;
}
inline char read() {
  static const int IN_LEN = 1000000;
  static char buf[IN_LEN], *s, *t;
  return (s == t               ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin),
          (s == t ? -1 : *s++) : *s++);
}
template <class T>
inline void read(T &x) {
  static bool iosig;
  static char c;
  for (iosig = false, c = read(); !isdigit(c); c = read()) {
    if (c == '-') iosig = true;
    if (c == -1) return;
  }
  for (x = 0; isdigit(c); c = read()) x = x * 10 + (c ^ '0');
  if (iosig) x = -x;
}
char sr[10000000], z[20];
int C = -1, Z = 0;
void Ot() { fwrite(sr, 1, C + 1, stdout), C = -1; }
void print(int x) {
  if (x < 0) sr[++C] = '-', x = -x;
  while (z[++Z] = x % 10 + 48, x /= 10)
    ;
  while (sr[++C] = z[Z], --Z)
    ;
  sr[++C] = '\n';
}
string s;
string get(int pos) {
  string res = "";
  for (int i = 0; i <= pos; i++) res += s[i];
  int len = s.size();
  for (int i = len - 6 + pos; i < len; i++) res += s[i];
  return res;
}
int work() {
  string tmp;
  for (int i = 0; i < 7; i++) {
    tmp = get(i);
    if (tmp == "keyence") return 1;
  }
  return 0;
}
int main() {
  cin >> s;
  cout << work() ? "YES" : "NO";
  return 0;
}
