import sys, time, random
from collections import deque, Counter, defaultdict
def debug(*x):print('debug:',*x, file=sys.stderr)
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 61 - 1
mod = 998244353

n, k = mi()
n -= 1
k -= 1
S = 'yuusaan'
n = min(n, 60)
cnt = [2]
L = [7]
for i in range(min(n, 60)):
    cnt.append(cnt[-1] * 2)
    L.append(L[-1] + 6 * cnt[-2])

def solve(n, k):
    if n == 0:
        return S[k]
    else:
        mid = 'uusaa'
        if n >= 60:
            return solve(n - 1, k)
        if k >= L[n - 1] + 5:
            return solve(n - 1, k - L[n - 1] - 5)
        elif k >= L[n - 1]:
            return mid[k - L[n - 1]]
        else:
            return solve(n - 1, k)
    
print(solve(n, k))