#include <bits/stdc++.h>
const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long int llINF = 1000000000000000000;
using namespace std;
using ll = long long int;
using edge = struct {
  int to;
  int cost;
};
ll pow_(ll a, ll n) {
  ll x = 1;
  while (n > 0) {
    if (n & 1) x = (x * a) % MOD;
    a = (a * a) % MOD;
    n >>= 1;
  }
  return x;
}
vector<ll> divisor(ll n) {
  vector<ll> ret;
  for (ll i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      ret.push_back(i);
      if (i * i != n) ret.push_back(n / i);
    }
  }
  sort(begin(ret), end(ret));
  return (ret);
}
map<ll, int> prime_factor(ll n) {
  map<ll, int> ret;
  for (ll i = 2; i * i <= n; i++) {
    while (n % i == 0) {
      ret[i]++;
      n /= i;
    }
  }
  if (n != 1) ret[n] = 1;
  return ret;
}
ll factorial(int n) {
  ll ans = 1;
  for (int i = 2; i <= n; i++) {
    ans *= i;
    ans %= MOD;
  }
  return ans;
}
ll P(int n, int m) {
  ll ans = 1;
  for (int i = m + 1; i <= n; i++) {
    ans *= i;
    ans %= MOD;
  }
  return ans;
}
ll power(int n, int m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = power(n, m / 2);
    return (tmp * tmp) % MOD;
  } else {
    return (n * power(n, m - 1)) % MOD;
  }
}
ll C(int n, int m) {
  return (P(n, n - m) * power(factorial(m), MOD - 2)) % MOD;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
  ll N;
  string A;
  string B = "keyence";
  ll count = 0;
  ll once = 0;
  cin >> A;
  for (ll i = (0); i < (A.size()); i++) {
    if (A[i] == B[count] && count < 7) {
      count++;
      if (once == 1) once = 2;
    } else if (once == 0) {
      once = 1;
    } else if (once == 2) {
      count = 0;
      break;
    }
  }
  if (count != 7) {
    count = 0;
    for (ll i = (A.size() - 7); i < (A.size()); i++) {
      if (A[i] == B[count]) count++;
    }
  }
  if (count == 7)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}
