#include <bits/stdc++.h>
using namespace std;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
template <class T = int>
T in() {
  T x;
  cin >> x;
  return (x);
}
template <class T>
void print(T& x) {
  cout << x << '\n';
}
const int MOD = (int)1e9 + 7;
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMint() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAX; i++) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}
long long COM(int n, int k) {
  if (n < k) return 0;
  if (n < 0 || k < 0) return 0;
  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  if (a > b) {
    swap(a, b);
  }
  return gcd(a, b % a);
}
long long lcm(long long a, long long b) {
  long long g;
  g = gcd(a, b);
  return a * b / g;
}
double ep(int all, double p) { return all * (1 / p); }
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  string key = "keyence";
  int k;
  string s = in<string>();
  if (s.find("keyence") == 0 || s.find("keyence") == s.length() - 7) {
    print("Yes");
    return 0;
  } else {
    for (int i = 0; i < (s.length()); ++i) {
      if (s[i] == key[i]) {
        k++;
      } else {
        break;
      }
    }
    for (int i = s.length() - (7 - k); i < s.length(); i++) {
      if (s[i] == key[k]) {
        k++;
      } else {
        print("No");
        return 0;
      }
    }
  }
  print("Yes");
  return 0;
}
