#include <bits/stdc++.h>
using namespace std;
bool prime[500010];
void SieveOfEratosthenes(long long n) {
  memset(prime, true, sizeof(prime));
  for (long long p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (long long i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
}
long long power(long long x, long long y) {
  if (y == 0)
    return 1;
  else if (y % 2 == 0)
    return power(x, y / 2) * power(x, y / 2);
  else
    return x * power(x, y / 2) * power(x, y / 2);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  string s;
  cin >> s;
  long long c = -1;
  vector<long long> v;
  string a = "keyence";
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == a[i]) {
      c = i;
    } else {
      break;
    }
  }
  if (1) {
    bool x = true;
    if (c + 1 == 7)
      cout << "YES";
    else {
      long long cnt = 6;
      if (c == -1) c = 5;
      for (long long i = s.size() - 1; i >= s.size() - 1 - c - 1; i--) {
        if (s[i] != a[cnt]) {
          x = false;
          break;
        }
        cnt--;
      }
      if (x)
        cout << "YES";
      else {
        cout << "NO";
      }
    }
  }
}
