#include <bits/stdc++.h>
const int inf = 1001001001;
const long long INF = 1001001001001001001;
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using vii = vector<int>;
using vll = vector<ll>;
template <class T>
using PS_queue = priority_queue<T, vector<T>, greater<T> >;
template <class T>
using vv = vector<T>;
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
  fill((T *)array, (T *)(array + N), val);
}
template <class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (auto i = (begin(v)); i != (end(v)); ++i)
    os << *i << (i == end(v) - 1 ? "" : " ");
  return os;
}
template <class T>
istream &operator>>(istream &is, vector<T> &v) {
  for (auto i = (begin(v)); i != (end(v)); ++i) is >> *i;
  return is;
}
template <class T, class U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first >> p.second;
  return is;
}
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
struct edge {
  int to, from, cost;
};
int dy[] = {0, 1, -1, 0};
int dx[] = {1, 0, 0, -1};
string s;
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> s;
  string t = "keyence";
  bool used[(int)t.size()];
  for (int i = 0; i < (s.size()); ++i) {
    for (int j = 0; j < (t.size()); ++j) {
      if (s[i] == t[j]) used[j] = true;
    }
  }
  for (int i = 0; i < (t.size()); ++i) {
    if (!used[i]) {
      cout << "NO" << endl;
      return 0;
    }
  }
  cout << "YES" << endl;
  return 0;
}
