#include <bits/stdc++.h>
using ll = long long;
using namespace std;
string solve(bool a) { return ((a) ? "Yes" : "No"); }
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
  os << "(" << p.first << "," << p.second << ")";
  return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  os << "{";
  for (int i = 0, i_len = (int)(v.size()); i < i_len; i++) {
    if (i) os << ",";
    os << v[i];
  }
  os << "}";
  return os;
}
template <class T, class U>
istream& operator>>(istream& is, pair<T, U>& p) {
  is >> p.first >> p.second;
  return is;
}
template <class T>
istream& operator>>(istream& is, vector<T>& v) {
  for (int i = 0, i_len = (int)(v.size()); i < i_len; i++) {
    is >> v[i];
  }
  return is;
}
const long long INFLL = 1LL << 60;
const int INF = 1 << 30;
const double PI = acos(-1);
int main() {
  string s;
  int ans = 0;
  cin >> s;
  int left, right;
  string ter = "keyence";
  for (left = 0; left < ter.size() and s[left] == ter[left]; left++) {
  }
  if (s[left] != ter[left] and left != 0) {
  }
  for (right = 0; right < ter.size() and
                  s[s.size() - right - 1] == ter[ter.size() - 1 - right];
       right++) {
    clog << s[s.size() - right - 1] << " " << ter[ter.size() - 1 - right]
         << endl;
  }
  if (s[s.size() - right - 1] != ter[ter.size() - 1 - right] and right != 0) {
  }
  clog << right << " " << left << endl;
  cout << solve(ter.size() <= left + right) << endl;
}
