#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("-O2")
template <class T>
using min_heap = priority_queue<T, std::vector<T>, std::greater<T> >;
string s;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> s;
  int n = s.length();
  for (int i = -1; i <= n - 1; i++) {
    for (int j = i + 1; j <= n - 1; j++) {
      vector<char> v;
      for (int k = 0; k <= i; k++) v.push_back(s[k]);
      for (int k = j; k <= n - 1; k++) v.push_back(s[k]);
      if (int(v.size()) >= 7 && v[0] == 'k' && v[1] == 'e' && v[2] == 'y' &&
          v[3] == 'e' && v[4] == 'n' && v[5] == 'c' && v[6] == 'e') {
        cout << "YES\n";
        return 0;
      }
    }
  }
  cout << "NO\n";
}
