#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	ll n, k; cin >> n >> k;
	auto calc = [&](auto self, ll level, ll k) -> char {
		if (level >= 30) {
			if (k < level) {
				return 'y';
			}
			return self(self, 29, k - (level-29));
		}

		if (level == 1) {
			return "yuusaan"[k];
		}

		ll onedownsize = (1LL<<(2*level-1))-1;

		ll t = 0;
		if (k < t + 1) {
			return 'y';
		}
		t += 1;
		if (k < t + onedownsize) {
			return self(self, level-1, k - t);
		}
		t += onedownsize;
		if (k < t + onedownsize) {
			return self(self, level-1, k - t);
		}
		t += onedownsize;
		if (k < t + 1) {
			return 's';
		}
		t += 1;
		if (k < t + onedownsize) {
			return self(self, level-1, k - t);
		}
		t += onedownsize;
		if (k < t + onedownsize) {
			return self(self, level-1, k - t);
		}
		t += onedownsize;
		if (k < t + 1) {
			return 'n';
		}
		t += 1;
		return '%';
		
	};

	cout << calc(calc, n, k-1) << endl;;
}