#include <bits/stdc++.h>
using namespace std;
inline bool IsPrime(int p) {
  if (p == 1) return false;
  for (int i = 2; i <= sqrt(p); i++) {
    if (p % i == 0) return false;
  }
  return true;
}
inline int GetDigit(int num) { return (int)log10(num) + 1; }
int GetDigitsSum(int num) {
  int N = 0;
  while (num > 0) {
    N += num % 10;
    num /= 10;
  }
  return N;
}
long long gcd(long long a, long long b) {
  if (a < b) {
    return gcd(b, a);
  } else if (a % b) {
    return gcd(b, a % b);
  } else {
    return b;
  }
}
int combination(int n, int r) {
  if (r == 0 || n == r) {
    return 1;
  } else if (r == 1) {
    return n;
  } else {
    return combination(n - 1, r - 1) + combination(n - 1, r);
  }
}
map<int, int> prime_factor(int n) {
  map<int, int> res;
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      while (n % i == 0) {
        res[i]++;
        n /= i;
      }
    }
  }
  if (n != 1) res[n] = 1;
  return res;
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  bool flg = false;
  string S;
  cin >> S;
  string X = "keyence";
  int j = 0;
  vector<int> v;
  bool k = false;
  for (int i = 0; i < (int)S.length(); i++) {
    if (S[i] == X[j]) {
      j++;
    } else {
      k = true;
      v.push_back(i);
    }
    if (j >= 7) {
      flg = true;
    }
  }
  bool can = true;
  int cnt = 0;
  if (k) {
    for (int i = 0; i < v.size() - 1; i++) {
      if (v[i] + 1 == v[i + 1]) {
      } else {
        cnt++;
      }
    }
  }
  if (cnt > 1) {
    can = false;
  }
  if (flg && can) {
    cout << "YES" << endl;
  } else {
    cout << "NO" << endl;
  }
  return 0;
}
