



from __future__ import annotations

from random import choice




def 	__UpperCamelCase	(  _lowerCAmelCase		)       ->  Optional[int]:



    """simple docstring"""






    return choice(_lowerCAmelCase		)




def 	__UpperCamelCase	(  _lowerCAmelCase      ,     _lowerCAmelCase		)       ->  int:



    """simple docstring"""






    A :       str          =   random_pivot(_lowerCAmelCase		)

    # partition based on pivot
    # linear time
    A :       Tuple          =   [e for e in lst if e < pivot]
    A :       int          =   [e for e in lst if e > pivot]

    # if we get lucky, pivot might be the element we want.
    # we can easily see this:
    # small (elements smaller than k)
    # + pivot (kth element)
    # + big (elements larger than k)
    if len(_lowerCAmelCase		) == k - 1:
        return pivot
    # pivot is in elements bigger than k
    elif len(_lowerCAmelCase		) < k - 1:
        return kth_number(_lowerCAmelCase      ,     k - len(_lowerCAmelCase		) - 1		)
    # pivot is in elements smaller than k
    else:
        return kth_number(_lowerCAmelCase      ,     _lowerCAmelCase		)


if __name__ == "__main__":
     import doctest

     doctest.testmod()







def 	__UpperCamelCase	(  _lowerCAmelCase      ,     _lowerCAmelCase		)       ->  int:



    """simple docstring"""






    while second != 0:
        A :       int          =   first & second
        first ^= second
        A :       Tuple          =   c << 1
    return first


if __name__ == "__main__":
     import doctest

     doctest.testmod()

     SCREAMING_SNAKE_CASE_:int             =						int(input("""Enter the first number: """).strip())
     SCREAMING_SNAKE_CASE_:Optional[int]             =						int(input("""Enter the second number: """).strip())
     print(F"""{add(first, second) = }""")


