
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <deque>
#include <queue>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
typedef long long ll;
typedef pair<int,int> P;
int main() {
    string t= "keyence";
    string s;
    cin >> s;
    int index = 0;
    rep(i, 0, s.size()){
        if(s[i] == t[index]) index++;
        if(index == t.size()-1) {
            cout << "YES" << endl;
            return 0;
        }
    }
    cout << "NO" << endl;
    return 0;
}
