#include <bits/stdc++.h>
using namespace std;
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
int jousu(int x00, int y00) {
  int z00 = 1;
  for (int i = 0; i < y00; i++) {
    z00 *= x00;
  }
  return z00;
}
int keta(int x00) {
  int z00 = x00;
  int w00 = 0;
  while (z00 != 0) {
    z00 /= 10;
    w00++;
  }
  return w00;
}
int modinv(int a, int m) {
  int b = m, u = 1, v = 0;
  while (b) {
    int t = a / b;
    a -= t * b;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  u %= m;
  if (u < 0) u += m;
  return u;
}
int modpow(int a, int n) {
  int res = 1;
  while (n > 0) {
    if (n & 1) res* a % 1000000007;
    a = a * a % 1000000007;
    n >>= 1;
  }
  return res;
}
int gcd(int xx, int yy) {
  int p = xx;
  int q = yy;
  if (q > p) swap(p, q);
  while (p % q != 0) {
    p %= q;
    swap(p, q);
  }
  return q;
}
int lcm(int xx, int yy) { return xx * yy / gcd(xx, yy); }
bool prime(int xx) {
  int a = xx;
  for (int i = 2; i * i <= xx; i++) {
    if (xx % i == 0) {
      return 0;
    }
  }
  return 1;
}
int com(int xx, int yy) {
  int zz = 1;
  for (int i = xx; i > xx - yy; i--) {
    zz *= i;
    zz %= 1000000007;
  }
  for (int i = 1; i <= yy; i++) {
    zz *= modinv(i, 1000000007);
    zz %= 1000000007;
  }
  return zz;
}
int main() {
  int a = 0;
  string s, s2 = "keyence";
  char c = 'k';
  cin >> s;
  for (int i = 0; i < (int)(s.size()); i++) {
    if (s[i] == c && a < 6) {
      a++;
      c = s2[a];
    }
  }
  if (a >= 6) {
    cout << "YES"
         << "\n";
  } else {
    cout << "NO"
         << "\n";
  }
}
