#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include <map>
#include <string>
#include <cmath>
#include <algorithm>
#include <queue>
#include <math.h>
#include <ctype.h>
#include <atcoder/modint>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repe(i,x,n) for(int i=x; i<(n); ++i)
using ll = long long;
using P = pair<int, int>;
using mint = atcoder::modint998244353;
#define pai 3.1415926535897932384
#define INF 10010010000
#define _GLIBCXX_DEBUG
#define All(a) (a).begin(),(a).end()
#define rAll(a) (a).rbegin(),(a).rend()
#define pb push_back
#define mk make_pair
#define yes cout << "Yes" << endl;
#define no cout << "No" << endl;
#define mod 998244353
#define mod2 1000000007
#define deci cout << fixed << setprecision(10);
#define nextP next_permutation
#define em emplace_back

int main() {

    string S, T = "kyoprotenkei90";
    cin >> S;
    map<char,ll> mp,np;
    set<char> s;
    rep(i,T.size()) {
        mp[T[i]]++;
        s.insert(T[i]);
    }
    rep(i,S.size()) {
        np[S[i]]++;
        if(!s.count(S[i])) {
            cout << "No" << endl;
            return 0;
        }
    }
    for(auto x:mp) {
        for(auto y:np) {
            if(x.first == y.first) {
                if(mp[x.first] != np[y.first]) {
                    cout << "No" << endl;
                }
            }
        }
    }
    cout << "Yes" << endl;
    return 0;

}