#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using uint = unsigned;
using ull = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    string s, t = "kyoprotenkei90";
    cin >> s;
    sort(s.begin(),s.end());
    sort(t.begin(),t.end());
    if(s == t) puts("Yes");
    else puts("No");
    return 0;
}