#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000007;
const int MAX_V = 201;
int now = 0;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAX; i++) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}
long long COM(int n, int k) {
  if (n < k) return 0;
  if (n < 0 || k < 0) return 0;
  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
struct edge {
  int t;
  edge(int _t) : t(_t) {}
};
bool use[100010];
vector<edge> te[100010];
vector<edge> fe[100010];
int t[64];
int d[100100];
long long rec(int num) {
  if (num == 0) return 0;
  return rec(num - 1) + num;
}
void Solve() {
  string s;
  cin >> s;
  string key = "keyence";
  int keyi = 0;
  for (size_t i = 0; i < s.size(); i++) {
    if (s[i] == key[keyi])
      keyi++;
    else {
      break;
    }
  }
  int keye = key.size() - 1;
  for (int i = s.size() - 1; i >= 0; i--) {
    if (s[i] == key[keye])
      keye--;
    else {
      break;
    }
  }
  if (keye == -1 || keye <= keyi) {
    cout << "YES" << endl;
  } else
    cout << "NO" << endl;
}
int main() {
  Solve();
  return 0;
}
