#include <bits/stdc++.h>
using namespace std;
int main() {
  int flag = 0;
  string s;
  string k("keyence");
  cin >> s;
  int s_len = (int)(s.length());
  int k_len = (int)(k.length());
  for (int i = 0; i < s_len; ++i) {
    if (s[i] == 'k') {
      int index = i;
      for (int j = 0; j < k_len; ++j) {
        if (s[index] != k[j]) {
          string a;
          string b;
          for (int m = index; m < s_len; ++m) {
            a += s[m];
          }
          for (int n = j; n < k_len; ++n) {
            b += k[n];
          }
          if (a.find(b) != string::npos) {
            cout << "YES" << endl;
            return 0;
          } else {
            flag = 1;
            break;
          }
        }
        ++index;
      }
      if (flag == 0) {
        cout << "YES" << endl;
        return 0;
      } else {
        flag = 0;
      }
    }
  }
  cout << "NO" << endl;
  return 0;
}
