#include <bits/stdc++.h>
using ll = long long;
using namespace std;
bool solve(string S) {
  string A = "keyence";
  if (S == A) return true;
  for (int i = 0, i_len = (S.size()); i < i_len; ++i) {
    if (A[i] == '\0') {
      return true;
    }
    if (S[i] != A[i]) {
      break;
    }
  }
  for (int i = 0, i_len = (S.size()); i < i_len; ++i) {
    int r = S.size() - i - 1;
    int n = A.size() - i - 1;
    if (S[r] != A[n]) {
      break;
    }
    if (A[n] == 'k') {
      return true;
    }
  }
  int cursor = 0;
  for (int i = 0, i_len = (S.size()); i < i_len; ++i) {
    if (S[i] != A[i]) {
      break;
    }
    ++cursor;
  }
  for (int i = 0, i_len = (S.size()); i < i_len; ++i) {
    int r = S.size() - i - 1;
    int n = A.size() - i - 1;
    if (S[r] != A[n]) {
      break;
    }
    if (i == cursor) {
      return true;
    }
  }
  return false;
}
int main() {
  string S;
  cin >> S;
  cout << (solve(S) ? "YES" : "NO") << endl;
  return 0;
}
