#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
struct UnionFind {
  vector<int> size, parents;
  UnionFind() {}
  UnionFind(int n) {
    size.resize(n, 0);
    parents.resize(n, 0);
    for (int i = 0; i < n; i++) makeTree(i);
  }
  void makeTree(int x) {
    parents[x] = x;
    size[x] = 1;
  }
  bool isSame(int x, int y) { return findRoot(x) == findRoot(y); }
  bool unite(int x, int y) {
    x = findRoot(x);
    y = findRoot(y);
    if (x == y) return false;
    if (size[x] > size[y]) {
      parents[y] = x;
      size[x] += size[y];
    } else {
      parents[x] = y;
      size[y] += size[x];
    }
    return true;
  }
  int findRoot(int x) {
    if (x != parents[x]) parents[x] = findRoot(parents[x]);
    return parents[x];
  }
  int treeSize(int x) { return size[findRoot(x)]; }
};
const double pi = acos(-1);
long long cei(long long x, long long y) {
  long long ans = x / y;
  if (x % y != 0) ans++;
  return ans;
}
long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; }
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }
long long llpow(long long x, long long n) {
  long long i, ans = 1;
  for ((i) = (0); (i) < (n); (i)++) ans *= x;
  return ans;
}
long long fact(long long x) {
  long long i, ans = 1;
  for ((i) = (0); (i) < (x); (i)++) ans *= (x - i);
  return ans;
}
long long ncr(long long n, long long r) {
  return fact(n) / fact(r) / fact(n - r);
}
long long npr(long long n, long long r) { return fact(n) / fact(n - r); }
bool prime(long long a) {
  if (a <= 1) return false;
  long long i;
  for (i = 2; i * i <= a; i++) {
    if (a % i == 0) return false;
  }
  return true;
}
long long fib(long long x) {
  long long i, fibo[x + 10];
  fibo[0] = 1;
  fibo[1] = 1;
  fibo[2] = 1;
  for ((i) = (3); (i) < (x + 1); (i)++) fibo[i] = fibo[i - 1] + fibo[i - 2];
  return fibo[x];
}
long long dig(long long n) {
  long long d = 0, tmp = n;
  while (tmp / 10 > 0) {
    tmp /= 10;
    d++;
  }
  return d;
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
long long i, j;
int main() {
  string s;
  cin >> s;
  bool used = false, now = false;
  long long cnt = 0;
  string t = "keyence";
  long long n = s.length();
  for ((i) = (0); (i) < (n); (i)++) {
    if (s[i] == t[cnt]) {
      cnt++;
    } else if (used)
      break;
    else {
      used = true;
      while (t[cnt] != s[i] && i < n) i++;
      cnt++;
    }
    if (cnt == 7 && i == n - 1) {
      puts("YES");
      return 0;
    }
    if (cnt == 7 && !used) {
      puts("YES");
      return 0;
    }
  }
  puts("NO");
  return 0;
}
