#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const double PI = acos(-1);
using ll = long long;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
vector<pair<ll, int>> factorize(ll n) {
  vector<pair<ll, int>> res;
  for (ll i = 2; i * i <= n; ++i) {
    if (n % i) continue;
    res.emplace_back(i, 0);
    while (n % i == 0) {
      n /= i;
      res.back().second++;
    }
  }
  if (n != 1) res.emplace_back(n, 1);
  return res;
}
int main() {
  string T = "keyence";
  string S;
  cin >> S;
  int pos = 0;
  for (int i = 0, i_len = (S.size()); i < i_len; ++i) {
    if (pos < 7 && S.at(i) == T.at(pos)) pos++;
  }
  if (pos == 7)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
