#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2 * 1e5 + 10;
const int MAX = 1e7 + 1;
double pi = 3.1415926535897932384626433832795;
const long long inf = 1e18;
long long mod = 998244353;
long long powr(long long a, long long b) {
  if (b == 0) return 1LL;
  long long x = powr(a, b / 2);
  x = (x * x) % mod;
  if (b % 2) return ((a % mod) * x) % mod;
  return x;
}
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int main() {
  string s;
  cin >> s;
  string ans = "keyence";
  int i = 0, j = 0;
  if (s[i] == ans[j]) {
    while (i < s.length() && j < ans.length() && s[i] == ans[j]) {
      i++;
      j++;
    }
    if (j == ans.length()) {
      cout << "YES\n";
      return 0;
    }
    while (i < s.length() && s[i] != ans[j]) i++;
    while (i < s.length() && j < ans.length() && s[i] == ans[j]) {
      i++;
      j++;
    }
    if (i == s.length() && ans.length())
      cout << "YES\n";
    else
      cout << "NO\n";
    return 0;
  }
  j = ((int)ans.size()) - 1;
  i = ((int)s.size()) - 1;
  while (i >= 0 && j >= 0 && s[i] == ans[j]) {
    i--;
    j--;
  }
  if (j == -1)
    cout << "YES\n";
  else
    cout << "NO\n";
  return 0;
}
