#include <bits/stdc++.h>
using namespace std;
const long long int LINF = 2000000000000000000ll;
const int INF = 1000000100;
const long long int MOD = 1e9 + 7;
int main() {
  string s;
  cin >> s;
  int n = s.length();
  string sm = "keyence";
  int prev = -1;
  bool flg = true;
  for (int i = 0; i < (7); ++i) {
    int id = -1;
    for (int j = prev + 1; j < (n); ++j) {
      if (s[j] == sm[i]) {
        id = j;
        break;
      }
    }
    if (id == -1) {
      puts("NO");
      return 0;
    }
    if (prev != id - 1) {
      if (!flg) {
        puts("NO");
        return 0;
      }
      flg = false;
    }
    prev = id;
  }
  puts("YES");
  return 0;
}
