#include <bits/stdc++.h>
#include <atcoder/segtree>
#include <atcoder/lazysegtree>
using namespace std;
using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define ll long long 
#define P pair<ll,ll>
const ll inf=1LL << 60;
int main(){
  string s;
  cin >> s;
  string t="kyoprotenkei90";
  map<char,int> mp,mp1;
  rep(i,t.size()){
    mp[t.at(i)]++;
  }
  rep(i,s.size()){
    mp1[s.at(i)]++;
  }
  string ans="Yes";
  for(auto p: mp){
    if(p.second!=mp1[p.first]){
      ans="No";
    }
  }
  cout << ans;
}