#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL;
ll ADD(ll x, ll y) { return (x + y) % MOD; }
ll SUB(ll x, ll y) { return (x - y + MOD) % MOD; }
ll MUL(ll x, ll y) { return x * y % MOD; }
ll POW(ll x, ll e) {
  ll v = 1;
  for (; e; x = MUL(x, x), e >>= 1)
    if (e & 1) v = MUL(v, x);
  return v;
}
ll DIV(ll x, ll y) { return MUL(x, POW(y, MOD - 2)); }
priority_queue<int> q_descending;
priority_queue<int, vector<int>, greater<int> > q_ascending;
int main(void) {
  ios_base::sync_with_stdio(false);
  string s;
  cin >> s;
  string ans = "keyence";
  int j = 0;
  int res = 0;
  for (int i = 0; i < (int)(s.size()); i++) {
    if (s[i] == ans[j]) {
      res++;
      j++;
    }
  }
  if (res == ans.size())
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}
