#include <bits/stdc++.h>
int gcd(int a, int b) {
  int c;
  while (b != 0) {
    c = a % b;
    a = b;
    b = c;
  }
  return a;
}
int lcm(int a, int b) {
  int c = gcd(a, b);
  a /= c;
  return a * b;
}
const int MOD = 1000000007;
const int INF = 1e9;
const long long LINF = INF * 1ll * INF;
const long double DINF = 1e200;
const double EPS = 1e-10;
const double PI = acos(-1.0);
using namespace std;
const long long dx[] = {0, 1, 0, -1};
const long long dy[] = {-1, 0, 1, 0};
signed main() {
  string s;
  cin >> s;
  for (long long i = 0; i < s.size(); i++) {
    if (s[i] == 'k') {
      if (s[i + 1] != 'e') {
        for (long long j = i + 2; j < s.size(); j++) {
        }
      }
    }
  }
  string tmp = "keyence";
  for (long long i = 0; i < s.size(); i++) {
    if (s.substr(0, i) == tmp.substr(0, i) &&
        s.substr(s.size() - i) == tmp.substr(tmp.size(), tmp.size())) {
      cout << "YES" << endl;
      return 0;
    }
  }
  cout << "NO" << endl;
}
