#include <bits/stdc++.h>
using namespace std;
constexpr long long MOD = 1000000007;
constexpr long long INF = numeric_limits<long long>::max() / 2;
using Graph = vector<vector<long long>>;
signed main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  string S, T;
  cin >> T;
  S = "keyence";
  long long N = S.size();
  long long M = T.size();
  bool ok = true;
  string Q1{}, Q2{};
  for (long long i = 0; i < (long long)(min(N, M)); i++) {
    if (S[i] == T[i]) {
      Q1 += S[i];
    } else
      break;
  }
  if (Q1 == S) {
    cout << "YES" << endl;
    return 0;
  }
  for (long long i = 1; i < min(N, M); i++) {
    if (S[N - i] == T[M - i]) {
      Q2 = S[N - i] + Q2;
    } else
      break;
  }
  if (Q1 + Q2 == S)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
