#include <bits/stdc++.h>
using namespace std;
map<long long unsigned int, long long unsigned int> primeFactors(
    long long unsigned int n) {
  map<long long unsigned int, long long unsigned int> ret;
  while (n % 2 == 0) {
    if (ret.find(2) != ret.end()) {
      ret[2]++;
    } else {
      ret[2] = 1;
    }
    n = n / 2;
  }
  for (long long unsigned int i = 3; i <= sqrt(n); i = i + 2) {
    while (n % i == 0) {
      if (ret.find(i) != ret.end()) {
        ret[i]++;
      } else {
        ret[i] = 1;
      }
      n = n / i;
    }
  }
  if (n > 2) {
    if (ret.find(n) != ret.end()) {
      ret[n]++;
    } else {
      ret[n] = 1;
    }
  }
  return ret;
}
void print_map(map<long long unsigned int, long long unsigned int> mp) {
  for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
    std::cout << "key = " << itr->first << ", val = " << itr->second << "\n";
  }
}
long long unsigned int nCrModp(long long unsigned int n,
                               long long unsigned int r,
                               long long unsigned int p) {
  long long unsigned int C[r + 1];
  memset(C, 0, sizeof(C));
  C[0] = 1;
  for (long long unsigned int i = 1; i <= n; i++) {
    for (long long unsigned int j = min(i, r); j > 0; j--)
      C[j] = (C[j] + C[j - 1]) % p;
  }
  return C[r];
}
long long unsigned int hantokei(long long unsigned int a,
                                long long unsigned int b,
                                long long unsigned int L) {
  long long unsigned int count = 0;
  while (a % L != b) {
    a++;
    count++;
  }
  return count;
}
long long unsigned int tokei(long long unsigned int a, long long unsigned int b,
                             long long unsigned int L) {
  long long unsigned int count = 0;
  while (a != b) {
    if (a == 0) {
      a = L;
    }
    a--;
    count++;
  }
  return count;
}
int vector_finder(std::vector<int> vec, int number) {
  auto itr = std::find(vec.begin(), vec.end(), number);
  size_t index = std::distance(vec.begin(), itr);
  if (index != vec.size()) {
    return 1;
  } else {
    return 0;
  }
}
int main() {
  string S;
  cin >> S;
  int index = 0;
  int count = 0;
  string key = "keyence";
  bool flag = false;
  for (int i = 0; i < (int)(S.size()); i++) {
    if (S[i] == key[index]) {
      index++;
      flag = false;
      if (index == 7) {
        cout << "YES" << endl;
        return 0;
      }
    } else {
      if (!flag) count++;
      flag = true;
      if (count > 1) {
        cout << "NO" << endl;
        return 0;
      }
    }
  }
  cout << "NO" << endl;
  return 0;
}
