#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	long long n, k; cin >> n >> k;
	long long nlen = 8;
	vector<long long>len(26, 1);
	rep2(i, 1, 26) {
		len[i] = nlen - 1;
		nlen *= 4;
	}
	if (n > 25) {
		if (n >= k) {
			cout << "y" << endl;
			return 0;
		}
		k -= n - 25;
		n = 25;
	}
	auto dfs = [&](auto &&self, int lv, long long count)->int {
		rep(i, 7) {
			if (0 == i || 3 == i || 6 == i || 1 == lv) {
				count++;
			}
			else {
				if (count + len[lv - 1] < k) {
					count += len[lv - 1];
				}
				else {
					return self(self, lv - 1, count);
				}
			}
			if (count == k)return i;
		}
	};
	int idx = dfs(dfs, n, 0);
	cout << string("yuusaan").substr(idx, 1) << endl;
	return 0;
}