#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>

#define mkp make_pair
#define mkt make_tuple
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
template <class T>
void chmin(T &a, const T &b) {
    if (a > b) a = b;
}
template <class T>
void chmax(T &a, const T &b) {
    if (a < b) a = b;
}

const string P = "kyoprotenkei90";

void solve() {
    string S;
    cin >> S;
    int N = S.size();

    vector<int> used(N, 0);
    for (auto pc : P) {
        bool ok = false;
        for (int i = 0; i < N; i++) {
            if (used[i]) continue;
            if (pc == S[i]) {
                used[i] = 1;
                ok = true;
                break;
            }
        }
        if (!ok) {
            cout << "No" << endl;
            return;
        }
    }

    cout << "Yes" << endl;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    solve();

    return 0;
}