#include <bits/stdc++.h>
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
using namespace std;
pair<long long, string> LongestCommonSubsequence(const string s,
                                                 const string t) {
  vector<vector<long long>> dp(s.size() + 1,
                               vector<long long>(t.size() + 1, 0));
  for (long long i = 1; i <= s.size(); i++) {
    for (long long j = 1; j <= t.size(); j++) {
      if (s[i - 1] == t[j - 1]) dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] + 1);
      dp[i][j] = max(dp[i][j], max(dp[i - 1][j], dp[i][j - 1]));
    }
  }
  long long i = s.size(), j = t.size();
  string subsequence = "";
  while (i > 0 && j > 0) {
    if (dp[i][j] == dp[i - 1][j])
      i--;
    else if (dp[i][j] == dp[i][j - 1])
      j--;
    else {
      subsequence = s[i - 1] + subsequence;
      i--;
      j--;
    }
  }
  return make_pair(dp[s.size()][t.size()], subsequence);
}
int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  std::cout << fixed << setprecision(15);
  ;
  string s;
  cin >> s;
  string t = "keyence";
  auto lcs = LongestCommonSubsequence(s, t);
  (lcs.first == t.size()) ? cout << "YES"
                                 << "\n"
                          : cout << "NO"
                                 << "\n";
}
