#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<int, int>;
const int INF = numeric_limits<int>::max();
long long mod(long long val, long long m) {
  long long res = val % m;
  if (res < 0) res += m;
  return res;
}
long long gcd(ll a, ll b) {
  if (a % b == 0) {
    return b;
  } else {
    return gcd(b, a % b);
  }
}
long long lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
  string s;
  cin >> s;
  string keyence = "keyence";
  int ii = 0;
  int i;
  for (i = 0; i < s.length(); i++) {
    if (s[i] == keyence[ii]) {
      if (i != ii) break;
      ii++;
    }
  }
  string ans = s.substr(0, ii) + s.substr(i, s.length() - ii);
  if (ans == keyence)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}
