#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
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;
    chmin<i64>(N, 55);
    vector<u64> len(N+1);
    len[1] = 7;
    string X = "yuusaan";
    for(i64 i=1; i<N; i++) len[i+1] = len[i] * 2 + 5;
    auto f = [&](auto& f, i64 n, i64 k) -> char {
        if(n == 1) return X[k];
        if(k < len[n-1]) return f(f, n-1, k);
        k -= i64(len[n-1]);
        if(k < 5) return X[k+1];
        k -= 5;
        return f(f, n-1, k);
    };
    cout << f(f, N, K-1) << endl;
}

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