def find_char(N, K):
    initial = ['y', 'u', 'u', 's', 'a', 'a', 'n']
    if N == 1:
        return initial[K-1]
    
    # Compute the lengths of each block in level N
    S = 7 ** (N-1)
    block_lengths = [1, S, S, 1, S, S, 1]
    
    # Compute prefix sums
    prefix = [0] * 8
    for i in range(7):
        prefix[i+1] = prefix[i] + block_lengths[i]
    
    # Find which block K falls into
    for i in range(7):
        if prefix[i] < K <= prefix[i+1]:
            block_index = i
            break
    
    char = initial[block_index]
    if char in ['u', 'a']:
        K_prime = K - prefix[block_index]
        return find_char(N-1, K_prime)
    else:
        return char

# Read input
N, K = map(int, input().split())
print(find_char(N, K))