#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
const long long int M = (pow(10, 9) + 7);
long long int dig(long long int N, long long int K) {
  long long int dig = 0;
  while (N) {
    dig++;
    N /= K;
  }
  return dig;
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  long long int g = gcd(a, b);
  return a / g * b;
}
long long int C(long long int N) { return N * (N - 1) / 2; }
long long int f(long long int n) {
  if (n == 0 || n == 1)
    return 1;
  else
    return (n * f(n - 1)) % M;
}
long long int divcnt(long long int N, long long int d) {
  long long int ans = 0;
  while (1) {
    if (N % d == 0) {
      ans++;
      N /= d;
    } else
      break;
  }
  return ans;
}
bool prime(long long int num) {
  if (num < 2)
    return false;
  else if (num == 2)
    return true;
  else if (num % 2 == 0)
    return false;
  double sqrtNum = sqrt(num);
  for (int i = 3; i <= sqrtNum; i += 2) {
    if (num % i == 0) return false;
  }
  return true;
}
vector<long long int> memo(pow(10, 6) + 1);
long long int fibo(long long int n) {
  if (n == 1)
    return 1;
  else if (n == 2)
    return 1;
  else if (memo[n] != 0)
    return memo[n];
  else
    return memo[n] = fibo(n - 1) + f(n - 2);
}
int main() {
  string S;
  cin >> S;
  string M = "keyence";
  long long int cnt = 0;
  long long int i = 0;
  int flag = 0;
  while (1) {
    if (S[i] == M[cnt]) {
      cnt++;
      if (flag == 1) flag = 2;
    } else {
      if (flag == 2) {
        cout << "NO" << endl;
        return 0;
      }
      flag = 1;
    }
    if (i == S.size() - 1) break;
    i++;
  }
  if (cnt == M.size())
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
