#include <bits/stdc++.h>
using namespace std;
using vi = vector<long long>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
const long long inf = 1001001001001001;
const int INF = 1001001001;
const int mod = 1000000007;
const double pi = 3.14159265358979323846;
template <class T>
bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
void out(T a) {
  cout << a << endl;
}
template <class T>
void outp(T a) {
  cout << '(' << a.first << ',' << a.second << ')' << endl;
}
template <class T>
void outvp(T v) {
  for (long long i = 0; i < (long long)(v.size()); i++) outp(v[i]);
}
template <class T>
void outv(T v) {
  for (long long i = 0; i < (long long)(v.size()); i++) {
    if (i) cout << ' ';
    cout << v[i];
  }
  cout << endl;
}
template <class T>
void outvv(T v) {
  for (long long i = 0; i < (long long)(v.size()); i++) {
    for (long long j = 0; j < (long long)(v[i].size()); j++) {
      if (j) cout << ' ';
      cout << v[i][j];
    }
    cout << endl;
  }
}
int main() {
  string multiset<long long>, T, str = "keyence";
  cin >> multiset<long long>;
  long long x = multiset<long long>.size();
  if (x == 7) {
    if (multiset<long long> == str)
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
    return 0;
  } else if (x > 7) {
    for (long long j = 0; j < (long long)(x); j++) {
      for (long long i = 0; i < (long long)(j + 1); i++) {
        T = "";
        for (long long k = i; k < (long long)(j + 1); k++) {
          T.push_back(multiset<long long>[k]);
        }
        if (T == str) {
          cout << "YES" << endl;
          return 0;
        }
      }
    }
    cout << "NO" << endl;
    return 0;
  }
  cout << "NO" << endl;
}
