



'''simple docstring'''





import operator as op




def 							lowerCamelCase	(					_snake_case	:    List[str]							):





    '''simple docstring'''


    lowercase__									=    []
    lowercase__									=    lambda _snake_case  ,_snake_case							: int(x / y							)  # noqa: E731 integer division operation
    lowercase__									=    {
        "^": op.pow,
        "*": op.mul,
        "/": div,
        "+": op.add,
        "-": op.sub,
    }  # operators & their respective operation

    # print table header
    print("Symbol".center(8							)  ,"Action".center(12							)  ,"Stack"  ,sep=" | "							)
    print("-" * (30 + len(_snake_case							))							)

    for x in post_fix:
        if x.isdigit():  # if x in digit
            stack.append(_snake_case							)  # append x to stack
            # output in tabular format
            print(x.rjust(8							)  ,("push(" + x + ")").ljust(12							)  ,",".join(_snake_case							)  ,sep=" | "							)
        else:
            lowercase__									=    stack.pop()  # pop stack
            # output in tabular format
            print("".rjust(8							)  ,("pop(" + b + ")").ljust(12							)  ,",".join(_snake_case							)  ,sep=" | "							)

            lowercase__									=    stack.pop()  # pop stack
            # output in tabular format
            print("".rjust(8							)  ,("pop(" + a + ")").ljust(12							)  ,",".join(_snake_case							)  ,sep=" | "							)

            stack.append(
                str(opr[x](int(_snake_case							)  ,int(_snake_case							)							)							)							)  # evaluate the 2 values popped from stack & push result to stack
            # output in tabular format
            print(
                x.rjust(8							)  ,("push(" + a + x + b + ")").ljust(12							)  ,",".join(_snake_case							)  ,sep=" | "  ,)

    return int(stack[0]							)


if __name__ == "__main__":
 SCREAMING_SNAKE_CASE__          =  input("\n\nEnter a Postfix Equation (space separated) = ").split(" ")
 print("\n\tResult = ", solve(Postfix))









'''simple docstring'''





def 							lowerCamelCase	(					_snake_case	:    int = 50_000_000							):





    '''simple docstring'''


    lowercase__									=    set()
    lowercase__									=    int((limit - 24) ** (1 / 2)							)

    lowercase__									=    set(range(3  ,prime_square_limit + 1  ,2							)							)
    primes.add(2							)
    for p in range(3  ,prime_square_limit + 1  ,2							):
        if p not in primes:
            continue
        primes.difference_update(set(range(p * p  ,prime_square_limit + 1  ,_snake_case							)							)							)

    for primea in primes:
        lowercase__									=    primea * primea
        for primea in primes:
            lowercase__									=    primea * primea * primea
            if square + cube >= limit - 16:
                break
            for primea in primes:
                lowercase__									=    primea * primea * primea * primea
                lowercase__									=    square + cube + tetr
                if total >= limit:
                    break
                ret.add(_snake_case							)

    return len(_snake_case							)


if __name__ == "__main__":
 print(f'''{solution() = }''')




