#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9;
const long long MOD = 1e9 + 7;
const double EPS = 1e-9;
const double PI = acos(-1.0);
const string T = "keyence";
bool lcs(string X, string Y) {
  int m = X.length();
  int n = Y.length();
  X = ' ' + X;
  Y = ' ' + Y;
  int c[m + 1][n + 1];
  fill(c[0], c[m + 1], 0);
  int maxl = -1;
  for (long long i = (1); i < (long long)(m + 1); ++i)
    for (long long j = (1); j < (long long)(n + 1); ++j) {
      if (X[i] == Y[j]) {
        c[i][j] = c[i - 1][j - 1] + 1;
      } else {
        c[i][j] = max(c[i - 1][j], c[i][j - 1]);
      }
      maxl = max(maxl, c[i][j]);
    }
  return maxl == n;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout << fixed << setprecision(15);
  string S;
  cin >> S;
  cout << ((lcs(S, T)) ? "YES" : "NO") << "\n";
}
