#include <bits/stdc++.h>
using namespace std;
const long long Mod = 1000000007;
struct P {
  long long pos, cost;
};
bool operator<(P a, P b) { return a.cost < b.cost; }
bool operator>(P a, P b) { return a.cost > b.cost; }
struct B {
  long long to, cost;
};
struct E {
  long long from, to, cost;
};
bool operator<(E a, E b) { return a.cost < b.cost; }
struct H {
  long long x, y;
};
bool operator<(H a, H b) {
  if (a.x != b.x) return a.x < b.x;
  return a.y < b.y;
}
bool operator>(H a, H b) {
  if (a.x != b.x) return a.x > b.x;
  return a.y > b.y;
}
bool operator==(H a, H b) { return a.x == b.x && a.y == b.y; }
bool operator!=(H a, H b) { return a.x != b.x || a.y != b.y; }
long long gcd(long long i, long long j) {
  if (i > j) swap(i, j);
  if (i == 0) return j;
  return gcd(j % i, i);
}
long double mod_pow(long double x, long long n, long long p) {
  long double res = 1;
  while (n > 0) {
    if (n & 1) res = res * x;
    x = x * x;
    n >>= 1;
  }
  return res;
}
const long long Inf = 3023372036854775807;
const int inf = 1500000000;
string s;
string h = "keyence";
bool solve(long long k, long long e, long long t, long long r) {
  for (long long i = k; i < e; i++) {
    if (s[i] != h[t + i - k]) return 0;
  }
  return 1;
}
signed main() {
  cin >> s;
  for (long long i = 0; i < h.size(); i++) {
    if (solve(0, i, 0, i)) {
      long long r = h.size() - i;
      if (solve(s.size() - r + 1, s.size() - 1, i + 1, h.size() - 1)) {
        cout << "YES\n";
        return 0;
      }
    }
  }
  cout << "NO\n";
}
