def solve():
    N, K = map(int, input().split())
    s = "yuusaan"
    while N > 1:
        part_length = 7 ** (N - 1)
        boundaries = [
            1,
            1 + part_length,
            1 + 2 * part_length,
            2 + 2 * part_length,
            2 + 3 * part_length,
            2 + 4 * part_length,
            3 + 4 * part_length
        ]
        part = 6  # default to last part if not found
        for i in range(7):
            if K <= boundaries[i]:
                part = i
                break
        if part in [0, 3, 6]:
            print(s[part])
            return
        else:
            if part == 1:
                K -= boundaries[0]
            elif part == 2:
                K -= boundaries[1]
            elif part == 4:
                K -= boundaries[3]
            elif part == 5:
                K -= boundaries[4]
            N -= 1
    print(s[K-1])

solve()