#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int n, m, r;
int field[100][100];
int d[100][100];
bool seen[100][100];
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};
int dfs(int x, int y) {
  seen[x][y] = true;
  r++;
  for (int i = 0; (i) < (int)(4); i++) {
    int nx = x + dx[i];
    int ny = y + dy[i];
    if (nx < 0 || nx >= m || ny < 0 || ny >= n) continue;
    if (seen[nx][ny]) continue;
    if (field[nx][ny] == 0) continue;
    if (d[nx][ny] != 1e9) continue;
    dfs(nx, ny);
  }
  return r;
}
int main() {
  string s;
  cin >> s;
  int n = s.size();
  string t = "keyence";
  int now = 0;
  int cnt = 0;
  for (int i = 0; (i) < (int)(n); i++) {
    if (s[i] != t[now]) {
      cnt++;
      while (i < n) {
        i++;
        if (s[i] == t[now]) break;
      }
    }
    if (s[i] == t[now]) now++;
  }
  if (cnt < 2 && now == 7)
    cout << "YES";
  else
    cout << "NO";
}
