#include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<vector<int>>;
vector<vector<int>> field;
vector<bool> seen;
const int MOD = 1000000007;
int gcd(int a, int b) {
  if (a % b == 0) {
    return b;
  } else {
    return gcd(b, a % b);
  }
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
bool is_prime(long long N) {
  if (N == 1) return false;
  for (long long i = 2; i * i <= N; ++i) {
    if (N % i == 0) return false;
  }
  return true;
}
int main() {
  string s;
  cin >> s;
  char a[7];
  a[0] = 'k';
  a[1] = 'e';
  a[2] = 'y';
  a[3] = 'e';
  a[4] = 'n';
  a[5] = 'c';
  a[6] = 'e';
  int j = 0;
  map<int, bool> ok;
  bool ok2 = false;
  for (int i = (0); i < (s.size()); ++i) {
    if (s[i] == a[j]) {
      ok[j] = true;
      j++;
    }
    if (ok[6] && i == s.size() - 1) ok2 = true;
  }
  if (ok2)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
