#include <iostream>
#include <vector>
#include <cassert>

using namespace std;
using ll = long long;

int main () {
    ll N, K; cin >> N >> K;

    // ちゃんと見ないといけないのはO(log(K))レベルくらいまで。
    if (K <= N) {
        cout << "y" << "\n";
        return 0;
    }

    // ちゃんと見ないといけないレベルのところまで掘り進める。

    const string yuusaan = "yuusaan";
    const int max_level = 25;
    vector<ll> length(max_level + 1);
    length[1] = 7;
    for (int i = 2; i <= max_level; i++) length[i] = 4 * length[i - 1] + 3;

    auto f = [&] (auto f, int level, ll place) {
        assert(level <= 25);
        assert(0 <= place);
        assert(place <= length[level]);
        if (level == 1) return yuusaan[place - 1];

        if (place == 1) return 'y';
        if (place == 2 + 2 * length[level - 1]) return 's';
        if (place == 3 + 4 * length[level - 1]) return 'n';

        ll cur = 1;
        if (place <= cur + length[level - 1]) return f(f, level - 1, place - cur);
        cur += length[level - 1];

        if (place <= cur + length[level - 1]) return f(f, level - 1, place - cur);
        cur += length[level - 1];

        cur++;

        if (place <= cur + length[level - 1]) return f(f, level - 1, place - cur);
        cur += length[level - 1];

        if (place <= cur + length[level - 1]) return f(f, level - 1, place - cur);
        cur += length[level - 1];

        assert(0);
    };

    for (int i = 1; i <= max_level; i++) {
        if (K - (N - i) <= length[i]) {
            cout << f(f, i, K - (N - i)) << "\n";
            break;
        }
    }
}