#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <tuple>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<int(n); i++)
const i64 INF = 1001001001001001001;
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
#include <atcoder/modint>
using Modint = atcoder::static_modint<998244353>;
using namespace std;

void testcase(){
    i64 N, K; cin >> N >> K;
    if(100 < N){
        if(K <= N){ cout << "y\n"; return; }
        K -= N - 100;
        N = 100;
    }
    vector<i64> L(28); L[0] = 7;
    rep(i,27) L[i+1] = L[i] * 4 + 3;
    auto f = [&](auto& f, i64 n, i64 k) -> char {
        if(n == 0) return "yuusaan"[k];
        for(char c : string("y..s..n")){
            if(c == '.'){
                if(k < L[n-1]) return f(f, n-1, k);
                k -= L[n-1];
            } else {
                if(k == 0) return c;
                k--;
            }
        }
    };
    cout << f(f, N-1, K-1) << '\n';
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    testcase();
    return 0;
}