from functools import lru_cache
import pypyjit
pypyjit.set_param('max_unroll_recursion=-1')

N, K = map(int, input().split())

T = 'yuusaan'
@lru_cache(maxsize=None)
def find(n, k):
    if n > 100:
        if k <= n-100:
            return 'y'
        else:
            return find(100, k-n+100)
    if n == 1:
        return T[k-1]

    if k <= 1:
        return 'y'
    elif k <= 1 + l(n-1):
        return find(n-1, k-1)
    elif k <= 1 + 2*l(n-1):
        return find(n-1, k-l(n-1)-1)
    elif k <= 2 + 2*l(n-1):
        return 's'
    elif k <= 2 + 3*l(n-1):
        return find(n-1, k-2*l(n-1)-2)
    elif k <= 2 + 4*l(n-1):
        return find(n-1, k-3*l(n-1)-2)
    else:
        return 'n'

@lru_cache(maxsize=None)
def l(n):
    if n == 1:
        return len(T)
    return 4*l(n-1)+3

print(find(N, K))