#include <bits/stdc++.h>
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dr[4] = {-1, 0, 1, 0};
const int dc[4] = {0, 1, 0, -1};
const int INF = 1e9;
int guki(int a) {
  if (a % 2 == 0)
    return 0;
  else
    return 1;
}
using namespace std;
int main() {
  string S;
  cin >> S;
  int size = S.size();
  string X = "keyence";
  int d = 0;
  if (S == X) {
    cout << "YES" << endl;
    return 0;
  }
  for (int i = (int)(0); i < (int)(size); ++i) {
    if (S[i] == X[d]) {
      while (S[i] == X[d]) {
        i++;
        d++;
      }
      if (X.substr(d, 7 - d) == S.substr(size - (7 - d), 7 - d)) {
        cout << "YES" << endl;
        return 0;
      }
    }
  }
  if (S[0] != 'k') {
    if (S.substr(size - 8, 7) == "keyence") {
      cout << "YES" << endl;
      return 0;
    }
  }
  if (S.substr(0, 7) == "keyence") {
    cout << endl;
    return 0;
  }
  cout << "NO" << endl;
}
