#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll fact(int i) {
  if (i == 0) return 1;
  return (fact(i - 1)) * i;
}
ll gcd(ll a, ll b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int keta(ll n) {
  if (n == 0) return 1;
  int count = 0;
  while (n != 0) {
    n /= 10;
    count++;
  }
  return count;
}
ll ketasum(ll n) {
  ll sum = 0;
  while (n != 0) {
    sum += n % 10;
    n /= 10;
  }
  return sum;
}
int main() {
  string s;
  cin >> s;
  for (int i = 0; i < (int)(8); i++) {
    if (s.substr(0, i) + s.substr(s.size() - i - 1) == "keyence") {
      cout << "YES\n";
      return 0;
    } else
      continue;
  }
  cout << "NO\n";
  return 0;
}
