






def       _SCREAMING_SNAKE_CASE    (			__lowercase :      int      ,					__lowercase :      int      ,					__lowercase :      int     )    ->   int:





    """simple docstring"""

    if exponent == 1:
        return base
    if exponent % 2 == 0:
        __A       =						_modexpt(__lowercase      ,					exponent // 2      ,					__lowercase     ) % modulo_value
        return (x * x) % modulo_value
    else:
        return (base * _modexpt(__lowercase      ,					exponent - 1      ,					__lowercase     )) % modulo_value



def       _SCREAMING_SNAKE_CASE    (			__lowercase :      int = 1_7_7_7      ,					__lowercase :      int = 1_8_5_5      ,					__lowercase :      int = 8     )    ->   int:





    """simple docstring"""

    __A       =						base
    for _ in range(1      ,					__lowercase     ):
        __A       =						_modexpt(__lowercase      ,					__lowercase      ,					1_0**digits     )

    return result


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












from __future__ import annotations



def       _SCREAMING_SNAKE_CASE    (			__lowercase :      list[int]      ,					__lowercase :      int     )    ->   bool:





    """simple docstring"""

    if len(__lowercase     ) == 0:
        return False
    __A       =						len(__lowercase     ) // 2
    if a_list[midpoint] == item:
        return True
    if item < a_list[midpoint]:
        return binary_search(a_list[:midpoint]      ,					__lowercase     )
    else:
        return binary_search(a_list[midpoint + 1 :]      ,					__lowercase     )


if __name__ == "__main__":
  __a   :							Tuple						= input("Enter numbers separated by comma:\n").strip()
  __a   :							Any						= [int(item.strip()) for item in user_input.split(",")]
  __a   :							List[Any]						= int(input("Enter the number to be found in the list:\n").strip())
  __a   :							Optional[int]						= "" if binary_search(sequence, target) else "not "
  print(f"""{target} was {not_str}found in {sequence}""")




