#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const long long MOD = 1e9 + 7;
long long gcd(long long x, long long y) {
  if (y == 0) return 0;
  return gcd(y, x % y);
}
int dis2(int x1, int y1, int x2, int y2) {
  return (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
}
int main() {
  string s;
  cin >> s;
  string t = "keyence";
  int f = 0, b = 0;
  while (f < (int)t.size() && s[f] == t[f]) f++;
  while (b < (int)t.size() &&
         s[(int)s.size() - 1 - b] == t[(int)t.size() - 1 - b])
    b++;
  if (f == (int)t.size() || b == (int)t.size() || f + b == 7) {
    cout << "YES" << endl;
  } else
    cout << "NO" << endl;
  return 0;
}
